3471 search results - page 81 / 695 » Obstacle Numbers of Graphs |
DM
2007
13 years 9 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
DM
1998
13 years 9 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
PRL
1998
13 years 9 months ago
1998
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
JGT
2010
13 years 7 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...