4865 search results - page 158 / 973 » The Complexity of Graph Connectivity |
97
Voted
DAM
2010
15 years 21 days ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
115
click to vote
MST
2011
14 years 7 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
126
click to vote
RSA
2010
14 years 11 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...
125
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
100
Voted
CORR
2006
Springer
15 years 20 days ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...