3105 search results - page 307 / 621 » The Path-Packing Structure of Graphs |
154
click to vote
COR
2010
15 years 4 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
149
click to vote
DAM
2010
15 years 4 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
154
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
175
click to vote
TVCG
2008
15 years 4 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
156
click to vote
GG
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...