Algorithms and Computation
From MaRDI portal
Publication:5897882
DOI10.1007/11602613zbMath1173.05353OpenAlexW2304246803MaRDI QIDQ5897882
Christoforos L. Raptopoulos, Paul G. Spirakis
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Colouring Non-sparse Random Intersection Graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs ⋮ On the independence number and Hamiltonicity of uniform random intersection graphs ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ Expander properties and the cover time of random intersection graphs
This page was built for publication: Algorithms and Computation
