54 search results - page 5 / 11 » Linear Time Solvable Optimization Problems on Graphs of Boun... |
144
click to vote
DM
1999
15 years 3 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
131
click to vote
ECCC
2006
15 years 4 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
176
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
121
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
146
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...