Sciweavers

328 search results - page 11 / 66
» Algorithms for the edge-width of an embedded graph
Sort
View
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
13 years 10 months ago
Embedding k-outerplanar graphs into l1
Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri R...
INFOCOM
2009
IEEE
14 years 3 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
GBRPR
2009
Springer
14 years 1 months ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
COCOON
1999
Springer
14 years 28 days ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
COMGEO
2012
ACM
12 years 4 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...