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. ...
: 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...
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...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
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...
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...