7 search results - page 1 / 2 » Deterministically Isolating a Perfect Matching in Bipartite ... |
89
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
79
Voted
COCO
2010
Springer
14 years 7 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
ESA
2004
Springer
15 years 2 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...