Restrictions of graph partition problems. I
From MaRDI portal
Publication:672380
DOI10.1016/0304-3975(95)00057-4zbMath0873.68158WikidataQ59567991 ScholiaQ59567991MaRDI QIDQ672380
Hans L. Bodlaender, Klaus Jansen
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00057-4
68R10: Graph theory (including graph drawing) in computer science
Related Items
Mutual exclusion scheduling, Tree partitioning under constraints. -- Clustering for vehicle routing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Processor optimization for flow graphs
- On a property of the class of n-colorable graphs
- A Linear Recognition Algorithm for Cographs
- The NP-completeness column: an ongoing guide
- Scheduling Interval-Ordered Tasks
- Efficient algorithms for interval graphs and circular-arc graphs