[图书][B] Handbook of graph drawing and visualization
R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
[图书][B] Basic graph theory
MS Rahman - 2017 - Springer
This book is written based on my class notes developed while teaching the undergraduate
graph theory course “Basic Graph Theory” at the Department of Computer Science and …
graph theory course “Basic Graph Theory” at the Department of Computer Science and …
Графы в программировании: обработка, визуализация и применение
ВН Касьянов, ВА Евстигнеев - 2003 - elibrary.ru
Книга содержит систематическое и полное изложение фундаментальных основ
современных компьютерных технологий, связанных с применением теории графов …
современных компьютерных технологий, связанных с применением теории графов …
[图书][B] Graphs and geometry
L Lovász - 2019 - books.google.com
Graphs are usually represented as geometric objects drawn in the plane, consisting of
nodes and curves connecting them. The main message of this book is that such a …
nodes and curves connecting them. The main message of this book is that such a …
Orderly spanning trees with applications
YT Chiang, CC Lin, HI Lu - SIAM Journal on Computing, 2005 - SIAM
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool
generalizes canonical orderings, which exist only for triconnected plane graphs. Although …
generalizes canonical orderings, which exist only for triconnected plane graphs. Although …
Straight-line drawings on restricted integer grids in two and three dimensions
This paper investigates the following question: Given a grid ϕ, where ϕ is a proper subset of
the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with …
the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with …
Convex drawings of graphs in two and three dimensions (preliminary version)
We provide O (n)-time algorithms for constructing the following types of drawings of n-vertex
3-connected planar graphs: q 2D convex grid drawings with (3n) x (3n/2) area under the …
3-connected planar graphs: q 2D convex grid drawings with (3n) x (3n/2) area under the …
Output-sensitive reporting of disjoint paths
G Di Battista, R Tamassia, L Vismara - Algorithmica, 1999 - Springer
A k-path query on a graph consists of computing k vertex-disjoint paths between two given
vertices of the graph, whenever they exist. In this paper we study the problem of performing k …
vertices of the graph, whenever they exist. In this paper we study the problem of performing k …
Selected open problems in graph drawing
F Brandenburg, D Eppstein, MT Goodrich… - Graph Drawing: 11th …, 2004 - Springer
Selected Open Problems in Graph Drawing | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …
A framework for circular drawings of networks
JM Six, IG Tollis - International Symposium on Graph Drawing, 1999 - Springer
Drawings of graphs which show the inherent strengths and weaknesses of structures with
clustered views would be advantageous additions to many network design tools. In this …
clustered views would be advantageous additions to many network design tools. In this …