193 search results - page 19 / 39 » The structure of almost all graphs in a hereditary property |
GD
1998
Springer
13 years 11 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
ICST
2009
IEEE
14 years 2 months ago
2009
IEEE
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...