2503 search results - page 57 / 501 » A study of 3-arc graphs |
162
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
152
click to vote
CSE
2009
IEEE
16 years 19 days ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
160
click to vote
APPROX
2009
Springer
16 years 14 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
153
click to vote
SEFM
2005
IEEE
15 years 11 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
173
click to vote
PADS
2004
ACM
15 years 11 months ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...