Paper Info
Title
Placing edge labels by modifying an orthogonal graph drawing
Abstract
In this paper we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost. We present a polynomial time algorithm that finds the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the drawing.
Year
DOI
Venue
2010
10.1007/978-3-642-18469-7_39
Graph Drawing
Keywords
Field
DocType
edge label,minimum increase,orthogonal graph,orthogonal graph drawing,overlap-free label,polynomial time algorithm,orthogonal representation,minimum cost,graph drawing
Graph drawing,Discrete mathematics,Outerplanar graph,Combinatorics,Slope number,Graph embedding,Computer science,Force-directed graph drawing,Clique-width,Dominance drawing,Lattice graph
Conference
Volume
ISSN
Citations 
6502
0302-9743
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Konstantinos G. Kakoulis111911.04
Ioannis G. Tollis21240162.75