1648 search results - page 39 / 330 » On the generation of bicliques of a graph |
105
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
APSEC
1997
IEEE
15 years 3 months ago
1997
IEEE
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
81
Voted
MICS
2008
14 years 11 months ago
2008
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...