3678 search results - page 81 / 736 » On the Stable Paths Problem |
118
Voted
MP
2006
15 years 19 days ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
141
Voted
COMGEO
2006
ACM
15 years 22 days ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
124
Voted
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
89
Voted
JAL
2002
15 years 11 days ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
101
click to vote
EOR
2007
15 years 19 days ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...