Compact-port routing models and applications to distance-hereditary graphs

DOI10.1006/jpdc.2001.1728zbMath0999.68015OpenAlexW2000275001MaRDI QIDQ5959185

Michele Flammini, Gabriele Di Stefano, Serafino Cicerone

Publication date: 2 December 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/617fa9d9bde16f5d04259cda1598e2e44acac18d

zbMATH Keywords

compact routingcompact-port-model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Networks with small stretch number ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Equistable distance-hereditary graphs ⋮ Distance-hereditary comparability graphs ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

This page was built for publication: Compact-port routing models and applications to distance-hereditary graphs