281 search results - page 2 / 57 » The Complexity of Planar Counting Problems |
CADE
1994
Springer
13 years 11 months ago
1994
Springer
FAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
ICALP
2001
Springer
14 years 5 days ago
2001
Springer
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...