Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Force-directed graph drawing (view), International Symposium on Graph Drawing (view), Layered graph drawing (view), Area (graph drawing) (view), Angular resolution (graph drawing) (view)

searching for Graph drawing 40 found (342 total)

alternate case: graph drawing

Holt graph (343 words) [view diff] exact match in snippet view article find links to article

symmetric graph with the same number of vertices and edges would have. The graph drawing on the right highlights this, in that it lacks reflectional symmetry

Isabel Cruz (515 words) [view diff] exact match in snippet view article find links to article

representation, geographic information systems, AI, visual languages, graph drawing, user interfaces, multimedia, information retrieval, and security. She

Marek Chrobak (184 words) [view diff] exact match in snippet view article find links to article

problem, on information dissemination in ad-hoc radio networks, and on graph drawing. In automata theory, Chrobak is known for his contributions to the study

Vladimir Batagelj (656 words) [view diff] case mismatch in snippet view article find links to article

contributions (with Andrej Mrvar) to Graph Drawing Contests in years: 1995, 1996, 1997, 1998, 1999, 2000 and 2005 / Graph Drawing Hall of Fame. In 2007 the book

St-planar graph (599 words) [view diff] case mismatch in snippet view article find links to article

Tollis, Ioannis G. (1998), "4.2 Properties of Planar Acyclic Digraphs", Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, pp. 89–96

Truncated dodecadodecahedron (612 words) [view diff] exact match in snippet view article find links to article

bendless three-dimensional orthogonal graph drawing", in Tollis, Ioannis G.; Patrignani, Marizio (eds.), Graph Drawing, Lecture Notes in Computer Science

Left-right planarity test (696 words) [view diff] case mismatch in snippet view article find links to article

Vetter, Sebastian (2013), "Testing planarity by switching trains", Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September

Truncated tetrahedron (1,483 words) [view diff] no match in snippet view article find links to article

edges. It is a connected cubic graph, and connected cubic transitive graph. drawing in De divina proportione (1509) drawing in Perspectiva Corporum Regularium

Homeomorphism (graph theory) (932 words) [view diff] exact match in snippet view article

by subdivision of the inner edge of H, then G′ and H′ have a similar graph drawing: Therefore, there exists an isomorphism between G' and H', meaning G

Schematic capture (612 words) [view diff] exact match in snippet view article find links to article

(December 2001). "A framework for human-computer interaction in directed graph drawing". Association for Computing Machinery. 9: 63–69. Retrieved December

Frank Ruskey (225 words) [view diff] case mismatch in snippet view article find links to article

Frank Ruskey Frank Ruskey at the Workshop on Theory and Practice of Graph Drawing, 2012 Alma mater University of California, San Diego Scientific career

List of unsolved problems in mathematics (20,026 words) [view diff] no match in snippet view article find links to article

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer

Supernode (circuit) (234 words) [view diff] case mismatch in snippet view article

Sen, Arunabha (2005). Graph Clustering Using Multiway Ratio Cut (Software Demonstration). Springer Berlin Heidelberg. Graph Drawing. pp. 291–296. v t e

Contact graph (483 words) [view diff] case mismatch in snippet view article find links to article

triangle-free rectangle arrangements and the squarability problem", Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, Los

Judy Butland (481 words) [view diff] case mismatch in snippet view article find links to article

2019. Butland; Butland (March 1980). "Special Feature: An Easy-to-Use Graph Drawing Package". Computer. 13(2), DOI: 10.1109/MC.1980.1653501 (2): 69–80.

Component (graph theory) (3,441 words) [view diff] exact match in snippet view article

JSTOR 2319608, MR 0371694 Wood, David R. (2014), "Three-dimensional graph drawing", in Kao, Ming-Yang (ed.), Encyclopedia of Algorithms (PDF), Springer

Balaban 11-cage (379 words) [view diff] no match in snippet view article find links to article

Combin. 15 (2008) Heal (2016) P. Eades, J. Marks, P. Mutzel, S. North. "Graph-Drawing Contest Report", TR98-16, December 1998, Mitsubishi Electric Research

Physical and logical qubits (1,712 words) [view diff] case mismatch in snippet view article find links to article

Mehdi (2013-06-09). "A Quantum Physical Design Flow Using ILP and Graph Drawing". Quantum Information Processing Journal. 12 (10): 3239. arXiv:1306

Higman–Sims graph (986 words) [view diff] case mismatch in snippet view article find links to article

Higman–Sims graph Drawing based on Paul R. Hafner's construction. Named after Donald G. Higman Charles C. Sims Vertices 100 Edges 1100 Radius 2 Diameter

List of performance analysis tools (599 words) [view diff] case mismatch in snippet view article find links to article

call-graph profiling. A set of visualization tools, VCG tools, uses the Call Graph Drawing Interface (CGDI) to interface with gprof. Another visualization tool

Roger Wattenhofer (362 words) [view diff] case mismatch in snippet view article find links to article

"Biographies of Invited Speakers". 24th International Symposium on Graph Drawing & Network Visualization. "Keynote by Prof. Roger Wattenhofer". ACM SenSys

Grinberg's theorem (1,161 words) [view diff] exact match in snippet view article find links to article

of k {\displaystyle k} vertices and k {\displaystyle k} edges of the graph drawing. A Hamiltonian cycle in a graph is a cycle that passes through each

Planar graph (4,541 words) [view diff] case mismatch in snippet view article find links to article

arXiv:math/0610935, doi:10.1142/S0129054106004248, S2CID 40107560. Special Issue on Graph Drawing. Bader, D.A.; Sreshta, S. (October 1, 2003), A New Parallel Algorithm

Prism graph (1,003 words) [view diff] exact match in snippet view article find links to article

David (2013), "The complexity of bendless three-dimensional orthogonal graph drawing", Journal of Graph Algorithms and Applications, 17 (1): 35–55, arXiv:0709

Folkman graph (1,392 words) [view diff] case mismatch in snippet view article find links to article

Folkman graph Drawing following Folkman (1967), Figure 1 Named after Jon Folkman Vertices 20 Edges 40 Radius 3 Diameter 4 Girth 4 Automorphisms 5! · 25

Cycle double cover (1,746 words) [view diff] case mismatch in snippet view article find links to article

3-edge-colorable graphs with polyhedral embeddings in orientable surfaces", Graph Drawing 2008, Editors: I.G. Tollis, M. Patrignani, Lecture Notes in Computer

Peripheral cycle (1,503 words) [view diff] case mismatch in snippet view article find links to article

Giuseppe; Eades, Peter; Tamassia, Roberto; Tollis, Ioannis G. (1998), Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, pp. 74–75

Good spanning tree (870 words) [view diff] exact match in snippet view article find links to article

Iqbal; Rahman, Md. Saidur (23 November 2015). "Good spanning trees in graph drawing". Theoretical Computer Science. 607: 149–165. doi:10.1016/j.tcs.2015

Protein–protein interaction (8,383 words) [view diff] exact match in snippet view article find links to article

interacting proteins determined by two-hybrid screening. They used a layered graph drawing method to find an initial placement of the nodes and then improved the

List of books in computational geometry (1,939 words) [view diff] exact match in snippet view article find links to article

robustness and numerical issues for geometric algorithms, animation, and graph drawing. In addition, the book surveys applications of geometric algorithms

Kirchberger's theorem (902 words) [view diff] case mismatch in snippet view article find links to article

convex geometry", Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, arXiv:2005.12568 Cordovil, Raul (1982), "Sur

Polyhedron (10,647 words) [view diff] case mismatch in snippet view article find links to article

convex polytopes", in van Kreveld, Marc J.; Speckmann, Bettina (eds.), Graph Drawing – 19th International Symposium, GD 2011, Eindhoven, The Netherlands

Midsphere (2,932 words) [view diff] exact match in snippet view article find links to article

Eppstein, David; Goodrich, Michael T. (2015), "The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral

Waveform graphics (3,326 words) [view diff] exact match in snippet view article find links to article

escape sequences being sent to cause the terminal to enter or exit graph drawing mode. Data sent between these two codes were interpreted by the graphics

Orthogonal circles (244 words) [view diff] case mismatch in snippet view article find links to article

arrangements of orthogonal circles", in Archambault, D.; Tóth, C. (eds.), Graph Drawing and Network Visualization, Proceedings of the 27th International Symposium

Dessin d'enfant (4,171 words) [view diff] exact match in snippet view article find links to article

Graph drawing used to study Riemann surfaces

Typography (cartography) (3,703 words) [view diff] case mismatch in snippet view article

"Labeling Algorithms," Chapter 15 in R. Tamassia, ed., Handbook of Graph Drawing and Visualization, CRC Press, pp.489-515. GIS Dictionary, 'Annotation'

Dual graph (6,607 words) [view diff] case mismatch in snippet view article find links to article

Giuseppe; Eades, Peter; Tamassia, Roberto; Tollis, Ioannis G. (1999), Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, p. 91,

Random binary tree (5,297 words) [view diff] case mismatch in snippet view article find links to article

beauty of random binary trees" (PDF), in Brandenburg, Franz J. (ed.), Graph Drawing: 3rd Int. Symp., GD'95, Passau, Germany, September 20–22, 1995, Lecture

List of women in mathematics (23,253 words) [view diff] exact match in snippet view article find links to article

mathematician and computer scientist, expert in computational geometry and graph drawing Alice S. Whittemore, American group theorist, biostatistician, and epidemiologist