3105 search results - page 293 / 621 » The Path-Packing Structure of Graphs |
163
click to vote
SIGECOM
2005
ACM
16 years 7 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
188
click to vote
APPROX
2004
Springer
16 years 3 days ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
181
click to vote
CAAN
2004
Springer
16 years 2 days ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
179
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
169
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...