Sciweavers

1633 search results - page 86 / 327
» Planar Map Graphs
Sort
View
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 9 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
ISAAC
2005
Springer
91views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Sparse Geometric Graphs with Small Dilation
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
Boris Aronov, Mark de Berg, Otfried Cheong, Joachi...
ENDM
2007
73views more  ENDM 2007»
13 years 10 months ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
APVIS
2006
13 years 11 months ago
Mental map preserving graph drawing using simulated annealing
Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...
Yi-Yi Lee, Chun-Cheng Lin, Hsu-Chun Yen
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
14 years 4 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera