2283 search results - page 124 / 457 » Bounds of Graph Characteristics |
115
Voted
PAMI
2006
15 years 3 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
158
Voted
RSA
2010
15 years 1 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
141
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
139
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
144
Voted
SPAA
2006
ACM
15 years 9 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...