2 search results - page 1 / 1 » Hamiltonian powers in threshold and arborescent comparabilit... |
DM
1999
13 years 10 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
CAAN
2004
Springer
14 years 4 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...