Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902508
DOI10.1007/b93953zbMath1255.90117MaRDI QIDQ5902508
Claudio Arbib, Michele Flammini, Fabrizio Marinelli
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Graph-Theoretic Concepts in Computer Science
