Name
Abstract | ||
|---|---|---|
Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11618058_32 | Graph Drawing |
Keywords | Field | DocType |
various graph,parameterized st-orientations,algorithms use st-numberings,single source,bipolar orientation,different area bound,different st-numberings,certain undirected graph,biconnected undirected graph,single sink,aesthetically different drawing,graph drawing,directed graph | Discrete mathematics,Outerplanar graph,Combinatorics,Line graph,Graph property,Biconnected graph,Computer science,Algorithm,Null graph,Butterfly graph,Voltage graph,Graph (abstract data type) | Conference |
Volume | ISSN | ISBN |
3843 | 0302-9743 | 3-540-31425-3 |
Citations | PageRank | References |
7 | 0.57 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charalampos Papamanthou | 1 | 1109 | 54.41 |
| Ioannis G. Tollis | 2 | 1240 | 162.75 |