9532 search results - page 436 / 1907 » Logic, Graphs, and Algorithms |
172
click to vote
ICTCS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
165
click to vote
GECCO
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
180
click to vote
ISAAC
1998
Springer
15 years 11 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
165
click to vote
ICALP
1997
Springer
15 years 11 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
142
click to vote
DAGSTUHL
2001
15 years 8 months ago
2001
We first give an overview of the features of the GANIMAL Framework introducing several new concepts not present in any previous algorithm animation system. Then we focus on its me...