1447 search results - page 38 / 290 » Graphs and Path Equilibria |
104
click to vote
DM
2006
15 years 3 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
127
Voted
ORL
2007
15 years 2 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
141
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
106
Voted
JGT
2007
15 years 3 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
152
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...