9532 search results - page 259 / 1907 » Logic, Graphs, and Algorithms |
156
click to vote
COMPGEOM
2009
ACM
16 years 20 days ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
165
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
148
click to vote
WDAG
2007
Springer
16 years 7 days ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
144
click to vote
IPL
2006
15 years 6 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
152
click to vote
IJCM
2008
15 years 6 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...