Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902523
DOI10.1007/b93953zbMath1255.90028MaRDI QIDQ5902523
Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos, Erlebach, Thomas
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation algorithms (68W25)
Related Items (8)
Minimum multiplicity edge coloring via orientation ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ Path multicoloring with fewer colors in spiders and caterpillars ⋮ An experimental study of maximum profit wavelength assignment in WDM rings ⋮ The \(k\)-edge intersection graphs of paths in a tree ⋮ Representing edge intersection graphs of paths on degree 4 trees ⋮ Wavelength assignment in multifiber star networks ⋮ Minimizing maximum fiber requirement in optical networks
This page was built for publication: Graph-Theoretic Concepts in Computer Science
