2125 search results - page 123 / 425 » On Graph Complexity |
RSA
2002
14 years 9 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
108
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
ISPD
2010
ACM
15 years 4 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
141
click to vote
PAMI
2010
14 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...