2125 search results - page 73 / 425 » On Graph Complexity |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
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...
WICON
2008
13 years 9 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
ACCV
1998
Springer
13 years 12 months ago
1998
Springer
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...