475 search results - page 86 / 95 » Z3-Connectivity with Independent Number 2 |
SODA
2004
ACM
15 years 24 days ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
BMCBI
2005
14 years 11 months ago
2005
Background: Protein domains have long been an ill-defined concept in biology. They are generally described as autonomous folding units with evolutionary and functional independenc...
STOC
1990
ACM
15 years 3 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
SODA
2008
ACM
15 years 26 days ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
133
click to vote
IPCO
2001
15 years 25 days ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...