1090 search results - page 9 / 218 » Priority Algorithms for Graph Optimization Problems |
110
click to vote
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...