Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(graph drawing). Showing records 1 – 30 of 60 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


University of Waterloo

1. Arroyo Guevara, Alan Marcelo. On Geometric Drawings of Graphs.

Degree: 2018, University of Waterloo

 This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing(more)

Subjects/Keywords: combinatorics; crossing numbers; graph theory; graph; drawing; complete graph; rectilinear; graph embedding; graph drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Arroyo Guevara, A. M. (2018). On Geometric Drawings of Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/13103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Arroyo Guevara, Alan Marcelo. “On Geometric Drawings of Graphs.” 2018. Web. 11 Dec 2019.

Vancouver:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/13103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arroyo Guevara AM. On Geometric Drawings of Graphs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


EPFL

2. Fulek, Radoslav. Intersection Patterns of Edges in Topological Graphs.

Degree: 2012, EPFL

 This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in… (more)

Subjects/Keywords: Topological graph; Graph drawing; Polyline drawing; Planar graph; Thrackle; Crossing number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fulek, R. (2012). Intersection Patterns of Edges in Topological Graphs. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/174699

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fulek, Radoslav. “Intersection Patterns of Edges in Topological Graphs.” 2012. Thesis, EPFL. Accessed December 11, 2019. http://infoscience.epfl.ch/record/174699.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fulek, Radoslav. “Intersection Patterns of Edges in Topological Graphs.” 2012. Web. 11 Dec 2019.

Vancouver:

Fulek R. Intersection Patterns of Edges in Topological Graphs. [Internet] [Thesis]. EPFL; 2012. [cited 2019 Dec 11]. Available from: http://infoscience.epfl.ch/record/174699.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fulek R. Intersection Patterns of Edges in Topological Graphs. [Thesis]. EPFL; 2012. Available from: http://infoscience.epfl.ch/record/174699

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

3. Lee, Seunghee. Upward Octagonal Drawings of Ternary Trees.

Degree: 2016, University of Waterloo

 We explore ways to embed a ternary tree in an integer coordinate grid such that the width of the drawing is minimized. We provide upper… (more)

Subjects/Keywords: graph drawing; ternary trees; octagonal; tree drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lee, S. (2016). Upward Octagonal Drawings of Ternary Trees. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10832

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lee, Seunghee. “Upward Octagonal Drawings of Ternary Trees.” 2016. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/10832.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lee, Seunghee. “Upward Octagonal Drawings of Ternary Trees.” 2016. Web. 11 Dec 2019.

Vancouver:

Lee S. Upward Octagonal Drawings of Ternary Trees. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/10832.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee S. Upward Octagonal Drawings of Ternary Trees. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10832

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Irvine

4. Bannister, Michael James. Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs.

Degree: Computer Science, 2015, University of California – Irvine

 We investigate the problem of algorithmically drawing graphs, i.e., the process of creating geometric representations of graphs. We primarily consider node-link diagrams, where the vertices… (more)

Subjects/Keywords: Computer science; graph drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bannister, M. J. (2015). Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/7j72h78r

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bannister, Michael James. “Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs.” 2015. Thesis, University of California – Irvine. Accessed December 11, 2019. http://www.escholarship.org/uc/item/7j72h78r.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bannister, Michael James. “Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs.” 2015. Web. 11 Dec 2019.

Vancouver:

Bannister MJ. Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs. [Internet] [Thesis]. University of California – Irvine; 2015. [cited 2019 Dec 11]. Available from: http://www.escholarship.org/uc/item/7j72h78r.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bannister MJ. Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs. [Thesis]. University of California – Irvine; 2015. Available from: http://www.escholarship.org/uc/item/7j72h78r

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Limerick

5. Ghassemi Toosi, Farshad. Novel heurisitic approaches to iterative graph drawing.

Degree: 2017, University of Limerick

 This thesis presents a new graph drawing approach (the concentric approach) for drawing any undirected graph without taking stress or forces into account, in order… (more)

Subjects/Keywords: graph drawing; algorithms; matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghassemi Toosi, F. (2017). Novel heurisitic approaches to iterative graph drawing. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/6554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ghassemi Toosi, Farshad. “Novel heurisitic approaches to iterative graph drawing.” 2017. Thesis, University of Limerick. Accessed December 11, 2019. http://hdl.handle.net/10344/6554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ghassemi Toosi, Farshad. “Novel heurisitic approaches to iterative graph drawing.” 2017. Web. 11 Dec 2019.

Vancouver:

Ghassemi Toosi F. Novel heurisitic approaches to iterative graph drawing. [Internet] [Thesis]. University of Limerick; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10344/6554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghassemi Toosi F. Novel heurisitic approaches to iterative graph drawing. [Thesis]. University of Limerick; 2017. Available from: http://hdl.handle.net/10344/6554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Manitoba

6. MONDAL, DEBAJYOTI. Embedding a Planar Graph on a Given Point Set.

Degree: Computer Science, 2012, University of Manitoba

 A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G,… (more)

Subjects/Keywords: Graph Drawing; Point-Set Embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

MONDAL, D. (2012). Embedding a Planar Graph on a Given Point Set. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/8869

Chicago Manual of Style (16th Edition):

MONDAL, DEBAJYOTI. “Embedding a Planar Graph on a Given Point Set.” 2012. Masters Thesis, University of Manitoba. Accessed December 11, 2019. http://hdl.handle.net/1993/8869.

MLA Handbook (7th Edition):

MONDAL, DEBAJYOTI. “Embedding a Planar Graph on a Given Point Set.” 2012. Web. 11 Dec 2019.

Vancouver:

MONDAL D. Embedding a Planar Graph on a Given Point Set. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1993/8869.

Council of Science Editors:

MONDAL D. Embedding a Planar Graph on a Given Point Set. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/8869


Penn State University

7. Viswanath, Archana. Enhanced force directed graph embedding algorithms.

Degree: MS, Computer Science and Engineering, 2008, Penn State University

Graph embedding is a pictorial representation of a graph G(V;E) on a surface, where V is the set of vertices and E is the set… (more)

Subjects/Keywords: graph embedding; graph drawing; force directed method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Viswanath, A. (2008). Enhanced force directed graph embedding algorithms. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8793

Chicago Manual of Style (16th Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Masters Thesis, Penn State University. Accessed December 11, 2019. https://etda.libraries.psu.edu/catalog/8793.

MLA Handbook (7th Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Web. 11 Dec 2019.

Vancouver:

Viswanath A. Enhanced force directed graph embedding algorithms. [Internet] [Masters thesis]. Penn State University; 2008. [cited 2019 Dec 11]. Available from: https://etda.libraries.psu.edu/catalog/8793.

Council of Science Editors:

Viswanath A. Enhanced force directed graph embedding algorithms. [Masters Thesis]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8793


University of Waterloo

8. Gordon, Taylor. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.

Degree: 2010, University of Waterloo

 We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an… (more)

Subjects/Keywords: Graph Drawing; Simultaneous Embeddings; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gordon, T. (2010). Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5174

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/5174.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gordon, Taylor. “Simultaneously Embedding Planar Graphs at Fixed Vertex Locations.” 2010. Web. 11 Dec 2019.

Vancouver:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/5174.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon T. Simultaneously Embedding Planar Graphs at Fixed Vertex Locations. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5174

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Manitoba

9. Mondal, Debajyoti. Visualizing graphs: optimization and trade-offs.

Degree: Computer Science, 2014, University of Manitoba

 Effective visualization of graphs is a powerful tool to help understand the relationships among the graph's underlying objects and to interact with them. Several styles… (more)

Subjects/Keywords: Graph Drawing; Algorithms; Planar Graph; Graph Thickness; Complete Graph; Polyline Drawing; Trade-offs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mondal, D. (2014). Visualizing graphs: optimization and trade-offs. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mondal, Debajyoti. “Visualizing graphs: optimization and trade-offs.” 2014. Thesis, University of Manitoba. Accessed December 11, 2019. http://hdl.handle.net/1993/31673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mondal, Debajyoti. “Visualizing graphs: optimization and trade-offs.” 2014. Web. 11 Dec 2019.

Vancouver:

Mondal D. Visualizing graphs: optimization and trade-offs. [Internet] [Thesis]. University of Manitoba; 2014. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1993/31673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mondal D. Visualizing graphs: optimization and trade-offs. [Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/31673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Klein, Karsten. Interactive graph drawing with constraints.

Degree: 2011, Technische Universität Dortmund

 In zahlreichen Anwendungsgebieten werden Informationen als Graphen modelliert und mithilfe dieser Graphen visualisiert. Eine übersichtliche Darstellung hilft bei der Analyse und unterstützt das Verständnis bei… (more)

Subjects/Keywords: Clustered planarity; Drawing constraints; Embedding constraints; Graph drawing applications; Graph embedding; Interactive graph drawing; Planarity; Planarization; Scaffold Hunter; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Klein, K. (2011). Interactive graph drawing with constraints. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27669

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Klein, Karsten. “Interactive graph drawing with constraints.” 2011. Thesis, Technische Universität Dortmund. Accessed December 11, 2019. http://hdl.handle.net/2003/27669.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Klein, Karsten. “Interactive graph drawing with constraints.” 2011. Web. 11 Dec 2019.

Vancouver:

Klein K. Interactive graph drawing with constraints. [Internet] [Thesis]. Technische Universität Dortmund; 2011. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2003/27669.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klein K. Interactive graph drawing with constraints. [Thesis]. Technische Universität Dortmund; 2011. Available from: http://hdl.handle.net/2003/27669

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

11. Ruiz Velázquez, Lesvia Elena. Drawing planar graphs with prescribed face areas.

Degree: 2010, University of Waterloo

 This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main… (more)

Subjects/Keywords: graph drawing; planar; prescribed face area

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ruiz Velázquez, L. E. (2010). Drawing planar graphs with prescribed face areas. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5481

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ruiz Velázquez, Lesvia Elena. “Drawing planar graphs with prescribed face areas.” 2010. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/5481.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ruiz Velázquez, Lesvia Elena. “Drawing planar graphs with prescribed face areas.” 2010. Web. 11 Dec 2019.

Vancouver:

Ruiz Velázquez LE. Drawing planar graphs with prescribed face areas. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/5481.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ruiz Velázquez LE. Drawing planar graphs with prescribed face areas. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5481

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

12. Haleem, Hammad CSE. Evaluating the readability of graph layouts : a deep learning approach.

Degree: 2018, Hong Kong University of Science and Technology

 Existing graph layout algorithms are usually not able to optimize all the aesthetic properties desired in a graph layout. To evaluate how well the desired… (more)

Subjects/Keywords: Information visualization; Geometrical drawing; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Haleem, H. C. (2018). Evaluating the readability of graph layouts : a deep learning approach. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Haleem, Hammad CSE. “Evaluating the readability of graph layouts : a deep learning approach.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed December 11, 2019. https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Haleem, Hammad CSE. “Evaluating the readability of graph layouts : a deep learning approach.” 2018. Web. 11 Dec 2019.

Vancouver:

Haleem HC. Evaluating the readability of graph layouts : a deep learning approach. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2019 Dec 11]. Available from: https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haleem HC. Evaluating the readability of graph layouts : a deep learning approach. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Wong, Hoi-Ming. Upward planarization and layout.

Degree: 2011, Technische Universität Dortmund

 Die Visualisierung von gerichteten azyklischen Graphen (DAGs) gehört zu den wichtigsten Aufgaben im automatischen Zeichnen von Graphen. Hierbei suchen wir für einen gegebenen DAG G… (more)

Subjects/Keywords: Graph drawing; Graph layout; Hierarchical drawings; Upward; Upward planarization; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wong, H. (2011). Upward planarization and layout. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/29141

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wong, Hoi-Ming. “Upward planarization and layout.” 2011. Thesis, Technische Universität Dortmund. Accessed December 11, 2019. http://hdl.handle.net/2003/29141.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wong, Hoi-Ming. “Upward planarization and layout.” 2011. Web. 11 Dec 2019.

Vancouver:

Wong H. Upward planarization and layout. [Internet] [Thesis]. Technische Universität Dortmund; 2011. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2003/29141.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wong H. Upward planarization and layout. [Thesis]. Technische Universität Dortmund; 2011. Available from: http://hdl.handle.net/2003/29141

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Irvine

14. Johnson, Timothy Underwood. Graph Drawing Metrics and Representations with Applications.

Degree: Computer Science, 2018, University of California – Irvine

 Much of graph drawing is based on drawing graphs as node-link diagrams, in which vertices are represented by points and edges are drawn as lines… (more)

Subjects/Keywords: Computer science; Contact representations; Graph drawing; Graph theory; Ply number

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Johnson, T. U. (2018). Graph Drawing Metrics and Representations with Applications. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/0p69h49p

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Johnson, Timothy Underwood. “Graph Drawing Metrics and Representations with Applications.” 2018. Thesis, University of California – Irvine. Accessed December 11, 2019. http://www.escholarship.org/uc/item/0p69h49p.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Johnson, Timothy Underwood. “Graph Drawing Metrics and Representations with Applications.” 2018. Web. 11 Dec 2019.

Vancouver:

Johnson TU. Graph Drawing Metrics and Representations with Applications. [Internet] [Thesis]. University of California – Irvine; 2018. [cited 2019 Dec 11]. Available from: http://www.escholarship.org/uc/item/0p69h49p.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johnson TU. Graph Drawing Metrics and Representations with Applications. [Thesis]. University of California – Irvine; 2018. Available from: http://www.escholarship.org/uc/item/0p69h49p

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Windsor

15. Sarker, Pijus Kumar. Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs.

Degree: MS, Computer Science, 2015, University of Windsor

  The point placement problem is to determine the position of n distinct points on a line, up to translation and reflection by fewest possible… (more)

Subjects/Keywords: Layer graph; Line rigid graph; Point placement problem; Rectangular drawing; Rigidity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sarker, P. K. (2015). Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5450

Chicago Manual of Style (16th Edition):

Sarker, Pijus Kumar. “Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs.” 2015. Masters Thesis, University of Windsor. Accessed December 11, 2019. https://scholar.uwindsor.ca/etd/5450.

MLA Handbook (7th Edition):

Sarker, Pijus Kumar. “Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs.” 2015. Web. 11 Dec 2019.

Vancouver:

Sarker PK. Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs. [Internet] [Masters thesis]. University of Windsor; 2015. [cited 2019 Dec 11]. Available from: https://scholar.uwindsor.ca/etd/5450.

Council of Science Editors:

Sarker PK. Experiments with Point Placement Algorithms and Recognition of Line Rigid Graphs. [Masters Thesis]. University of Windsor; 2015. Available from: https://scholar.uwindsor.ca/etd/5450

16. Raftopoulou, Chrysanthi. Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα.

Degree: 2016, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

Book embeddings are a well studied topic of graph theory with numerous applications. Research dates back to early 70s and has produced a vast litterature.… (more)

Subjects/Keywords: Θεωρία γραφημάτων; Απεικόνιση γραφημάτων; Graph theory; Graph drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Raftopoulou, C. (2016). Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/43369

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Raftopoulou, Chrysanthi. “Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα.” 2016. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed December 11, 2019. http://hdl.handle.net/10442/hedi/43369.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Raftopoulou, Chrysanthi. “Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα.” 2016. Web. 11 Dec 2019.

Vancouver:

Raftopoulou C. Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10442/hedi/43369.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Raftopoulou C. Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2016. Available from: http://hdl.handle.net/10442/hedi/43369

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


KTH

17. Aspegren, Villiam. CluStic – Automatic graph drawing with clusters.

Degree: Computer Science and Communication (CSC), 2015, KTH

<h2>Abstract</h2> Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been… (more)

Subjects/Keywords: Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aspegren, V. (2015). CluStic – Automatic graph drawing with clusters. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Thesis, KTH. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Aspegren, Villiam. “CluStic – Automatic graph drawing with clusters.” 2015. Web. 11 Dec 2019.

Vancouver:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Internet] [Thesis]. KTH; 2015. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aspegren V. CluStic – Automatic graph drawing with clusters. [Thesis]. KTH; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Bordeaux I

18. Lambert, Antoine. Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost.

Degree: Docteur es, Informatique, 2012, Université de Bordeaux I

Un graphe est un objet mathématique modélisant des relations sur un ensemble d'éléments. Il est utilisé dans de nombreux domaines à des fins de modélisation.… (more)

Subjects/Keywords: Visualisation de graphes; Dessin de graphes; Infographie; Graph visualization; Graph drawing; Computer graphics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lambert, A. (2012). Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2012BOR14664

Chicago Manual of Style (16th Edition):

Lambert, Antoine. “Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost.” 2012. Doctoral Dissertation, Université de Bordeaux I. Accessed December 11, 2019. http://www.theses.fr/2012BOR14664.

MLA Handbook (7th Edition):

Lambert, Antoine. “Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost.” 2012. Web. 11 Dec 2019.

Vancouver:

Lambert A. Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2012. [cited 2019 Dec 11]. Available from: http://www.theses.fr/2012BOR14664.

Council of Science Editors:

Lambert A. Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés : Interactive graph visualization : elaboration and optimisation of algorithms with high computationnal cost. [Doctoral Dissertation]. Université de Bordeaux I; 2012. Available from: http://www.theses.fr/2012BOR14664

19. Vaderna Renata. Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama.

Degree: 2018, University of Novi Sad

U sklopu doktorske disertacije izvršeno je istraživanje vezano za automatsko raspoređivanje elemenata dijagrama. Kroz analizu postojećih rešenja uočen je prostor za poboljšanja, posebno po… (more)

Subjects/Keywords: Teorija grafova, crtanje grafova, jezici specifični za domen; Graph theory, graph drawing, domain-specific languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Renata, V. (2018). Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama. (Thesis). University of Novi Sad. Retrieved from https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija152992259637266.pdf?controlNumber=(BISIS)107524&fileName=152992259637266.pdf&id=11567&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107524&source=OATD&language=en

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Renata, Vaderna. “Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama.” 2018. Thesis, University of Novi Sad. Accessed December 11, 2019. https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija152992259637266.pdf?controlNumber=(BISIS)107524&fileName=152992259637266.pdf&id=11567&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107524&source=OATD&language=en.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Renata, Vaderna. “Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama.” 2018. Web. 11 Dec 2019.

Vancouver:

Renata V. Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama. [Internet] [Thesis]. University of Novi Sad; 2018. [cited 2019 Dec 11]. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija152992259637266.pdf?controlNumber=(BISIS)107524&fileName=152992259637266.pdf&id=11567&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107524&source=OATD&language=en.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Renata V. Algoritmi i jezik za podršku automatskom raspoređivanju elemenata dijagrama. [Thesis]. University of Novi Sad; 2018. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija152992259637266.pdf?controlNumber=(BISIS)107524&fileName=152992259637266.pdf&id=11567&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=107524&source=OATD&language=en

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of British Columbia

20. Archambault, Daniel William. Feature-based graph visualization .

Degree: 2008, University of British Columbia

 A graph consists of a set and a binary relation on that set. Each element of the set is a node of the graph, while… (more)

Subjects/Keywords: Clustered graph drawing; Steerable systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Archambault, D. W. (2008). Feature-based graph visualization . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/2839

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Archambault, Daniel William. “Feature-based graph visualization .” 2008. Thesis, University of British Columbia. Accessed December 11, 2019. http://hdl.handle.net/2429/2839.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Archambault, Daniel William. “Feature-based graph visualization .” 2008. Web. 11 Dec 2019.

Vancouver:

Archambault DW. Feature-based graph visualization . [Internet] [Thesis]. University of British Columbia; 2008. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2429/2839.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Archambault DW. Feature-based graph visualization . [Thesis]. University of British Columbia; 2008. Available from: http://hdl.handle.net/2429/2839

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Linnaeus University

21. Köstinger, Harald. ViNCent – Visualization of NetworkCentralities.

Degree: Physics and Mathematics, 2011, Linnaeus University

  In the area of information visualization social or biological networks are visualized ina way so that they can be explored easily and one can… (more)

Subjects/Keywords: centralities; network analysis; visualization; social networks; biological networks; graph drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Köstinger, H. (2011). ViNCent – Visualization of NetworkCentralities. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-10793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Köstinger, Harald. “ViNCent – Visualization of NetworkCentralities.” 2011. Thesis, Linnaeus University. Accessed December 11, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-10793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Köstinger, Harald. “ViNCent – Visualization of NetworkCentralities.” 2011. Web. 11 Dec 2019.

Vancouver:

Köstinger H. ViNCent – Visualization of NetworkCentralities. [Internet] [Thesis]. Linnaeus University; 2011. [cited 2019 Dec 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-10793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Köstinger H. ViNCent – Visualization of NetworkCentralities. [Thesis]. Linnaeus University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-10793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Florida

22. Revoori, Soundarya. Computing the Rectilinear Crossing Number of K.

Degree: 2017, University of South Florida

 Rectilinear crossing number of a graph is the number of crossing edges in a drawing with all straight line edges. The problem of drawing an… (more)

Subjects/Keywords: Completely connected graphs; Heuristic; Graph Drawing; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Revoori, S. (2017). Computing the Rectilinear Crossing Number of K. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/6936

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Revoori, Soundarya. “Computing the Rectilinear Crossing Number of K.” 2017. Thesis, University of South Florida. Accessed December 11, 2019. https://scholarcommons.usf.edu/etd/6936.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Revoori, Soundarya. “Computing the Rectilinear Crossing Number of K.” 2017. Web. 11 Dec 2019.

Vancouver:

Revoori S. Computing the Rectilinear Crossing Number of K. [Internet] [Thesis]. University of South Florida; 2017. [cited 2019 Dec 11]. Available from: https://scholarcommons.usf.edu/etd/6936.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Revoori S. Computing the Rectilinear Crossing Number of K. [Thesis]. University of South Florida; 2017. Available from: https://scholarcommons.usf.edu/etd/6936

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Hosseini Alamdari, Soroush. Planar Open Rectangle-of-Influence Drawings.

Degree: 2012, University of Waterloo

 A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing, if there is no vertex in the relative interior of the… (more)

Subjects/Keywords: Computational Geometry; Graph Drawing

…Such a representation is called a drawing of the graph G. For simplicity the elements of the… …graph and the elements of the drawing are mostly referred to in an interchangeable way, that… …x28;see Figure 1.2). A graph is called planar if it has a planar drawing. A set of… …a) and a non-planar drawing (b) of the planar graph G with V (G)… …For example, the proximity drawing can model a graph modeling a method of communication… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hosseini Alamdari, S. (2012). Planar Open Rectangle-of-Influence Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6750

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/6750.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Web. 11 Dec 2019.

Vancouver:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/6750.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6750

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

24. Spriggs, Michael John. Morphing Parallel Graph Drawings.

Degree: 2007, University of Waterloo

 A pair of straight-line drawings of a graph is called parallel if, for every edge of the graph, the line segment that represents the edge… (more)

Subjects/Keywords: algorithms computational geometry graph drawing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Spriggs, M. J. (2007). Morphing Parallel Graph Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Spriggs, Michael John. “Morphing Parallel Graph Drawings.” 2007. Thesis, University of Waterloo. Accessed December 11, 2019. http://hdl.handle.net/10012/3083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Spriggs, Michael John. “Morphing Parallel Graph Drawings.” 2007. Web. 11 Dec 2019.

Vancouver:

Spriggs MJ. Morphing Parallel Graph Drawings. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10012/3083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Spriggs MJ. Morphing Parallel Graph Drawings. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New Mexico

25. Jeffries, Tanya. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.

Degree: Department of Computer Science, 2016, University of New Mexico

 The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms… (more)

Subjects/Keywords: bipartite; graph; drawing; crossing; minimization; stochastic; weighted; bottleneck

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jeffries, T. (2016). Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/32250

Chicago Manual of Style (16th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Masters Thesis, University of New Mexico. Accessed December 11, 2019. http://hdl.handle.net/1928/32250.

MLA Handbook (7th Edition):

Jeffries, Tanya. “Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants.” 2016. Web. 11 Dec 2019.

Vancouver:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Internet] [Masters thesis]. University of New Mexico; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1928/32250.

Council of Science Editors:

Jeffries T. Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants. [Masters Thesis]. University of New Mexico; 2016. Available from: http://hdl.handle.net/1928/32250


Brno University of Technology

26. Sysel, František. Lehce rozšiřitelný grafový editor .

Degree: 2011, Brno University of Technology

 Tato bakalářská práce se zabývá návrhem a implementací editoru grafů. Důraz je kladen na rozdělení celé aplikace do samostatných modulů, které je možno nahradit jinými… (more)

Subjects/Keywords: Modulární systém; zásuvný modul; graf; teorie grafů; vykreslení grafu.; Modular system; plug-in; graph; graph theory; graph drawing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sysel, F. (2011). Lehce rozšiřitelný grafový editor . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55799

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sysel, František. “Lehce rozšiřitelný grafový editor .” 2011. Thesis, Brno University of Technology. Accessed December 11, 2019. http://hdl.handle.net/11012/55799.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sysel, František. “Lehce rozšiřitelný grafový editor .” 2011. Web. 11 Dec 2019.

Vancouver:

Sysel F. Lehce rozšiřitelný grafový editor . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11012/55799.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sysel F. Lehce rozšiřitelný grafový editor . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55799

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Pennarun, Claire. Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes.

Degree: Docteur es, Informatique, 2017, Bordeaux

Dans cette thèse, nous présentons trois problèmes concernant les graphes planaires.Nous travaillons tout d'abord sur les dessins planaires non-alignés, c'est-à-dire des dessins planaires de graphes… (more)

Subjects/Keywords: Graphe planaire; Algorithme; Dessin planaire; Domination de puissance; Énumération; Planar graph; Algorithm; Graph drawing; Power domination; Enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pennarun, C. (2017). Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2017BORD0609

Chicago Manual of Style (16th Edition):

Pennarun, Claire. “Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes.” 2017. Doctoral Dissertation, Bordeaux. Accessed December 11, 2019. http://www.theses.fr/2017BORD0609.

MLA Handbook (7th Edition):

Pennarun, Claire. “Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes.” 2017. Web. 11 Dec 2019.

Vancouver:

Pennarun C. Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes. [Internet] [Doctoral dissertation]. Bordeaux; 2017. [cited 2019 Dec 11]. Available from: http://www.theses.fr/2017BORD0609.

Council of Science Editors:

Pennarun C. Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations : Graphes planaires : dessins non-alignés, domination de puissance et énumération d’orientations Eulériennes. [Doctoral Dissertation]. Bordeaux; 2017. Available from: http://www.theses.fr/2017BORD0609

28. Hinge, Antoine. Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study.

Degree: Docteur es, Informatique, 2018, Bordeaux

Les graphes, outil mathématique pour modéliser les relations entre des entités, sont en augmentation constante du fait d'internet (par exemple les réseaux sociaux). La visualisation… (more)

Subjects/Keywords: Visualisation; Big Data; Graphe; Dessin de graphe; Algorithmique distribuée; Visualization; Big Data; Graph; Graph Drawing; Distributed algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hinge, A. (2018). Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2018BORD0092

Chicago Manual of Style (16th Edition):

Hinge, Antoine. “Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study.” 2018. Doctoral Dissertation, Bordeaux. Accessed December 11, 2019. http://www.theses.fr/2018BORD0092.

MLA Handbook (7th Edition):

Hinge, Antoine. “Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study.” 2018. Web. 11 Dec 2019.

Vancouver:

Hinge A. Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study. [Internet] [Doctoral dissertation]. Bordeaux; 2018. [cited 2019 Dec 11]. Available from: http://www.theses.fr/2018BORD0092.

Council of Science Editors:

Hinge A. Dessin de graphe distribué par modèle de force : application au Big Data : Distributed force directed graph drawing : a Big Data case study. [Doctoral Dissertation]. Bordeaux; 2018. Available from: http://www.theses.fr/2018BORD0092


Brno University of Technology

29. Hübner, Lukáš. CAD systém pro 2D kreslení .

Degree: 2010, Brno University of Technology

 Bakalářská práce se zabývá charakteristikami počítačem podporovaného projektování a specifikuje typické metody kreslení používané v CAD systémech. Praktickou část tvoří program pro 2D kreslení, který… (more)

Subjects/Keywords: CAD; vektorová grafika; 2D kreslení; Open Scene Graph; CAD; vector graphics; 2D drawing; computer aided design; Open Scene Graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hübner, L. (2010). CAD systém pro 2D kreslení . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hübner, Lukáš. “CAD systém pro 2D kreslení .” 2010. Thesis, Brno University of Technology. Accessed December 11, 2019. http://hdl.handle.net/11012/56016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hübner, Lukáš. “CAD systém pro 2D kreslení .” 2010. Web. 11 Dec 2019.

Vancouver:

Hübner L. CAD systém pro 2D kreslení . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11012/56016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hübner L. CAD systém pro 2D kreslení . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/56016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Loughborough University

30. Newton, Matthew. Sequential and parallel algorithms for low-crossing graph drawing.

Degree: PhD, 2007, Loughborough University

 The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on… (more)

Subjects/Keywords: 511.5; Graph drawing : Bipartite graphs : Biplanar graphs : Genetic algorithms : Heuristic search : Parallel computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Newton, M. (2007). Sequential and parallel algorithms for low-crossing graph drawing. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017

Chicago Manual of Style (16th Edition):

Newton, Matthew. “Sequential and parallel algorithms for low-crossing graph drawing.” 2007. Doctoral Dissertation, Loughborough University. Accessed December 11, 2019. https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017.

MLA Handbook (7th Edition):

Newton, Matthew. “Sequential and parallel algorithms for low-crossing graph drawing.” 2007. Web. 11 Dec 2019.

Vancouver:

Newton M. Sequential and parallel algorithms for low-crossing graph drawing. [Internet] [Doctoral dissertation]. Loughborough University; 2007. [cited 2019 Dec 11]. Available from: https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017.

Council of Science Editors:

Newton M. Sequential and parallel algorithms for low-crossing graph drawing. [Doctoral Dissertation]. Loughborough University; 2007. Available from: https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017

[1] [2]

.