How to Pack Directed Acyclic Graphs into Small Blocks

DOI10.1007/11758471_27MaRDI QIDQ3434563zbMATH OpenOpenAlexFDO

Authors Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_27

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• How to pack directed acyclic graphs into small blocks
• Packing smaller graphs into a graph
• Mathematical Foundations of Computer Science 2004
• Packing directed cycles efficiently
• scientific article; zbMATH DE number 4127236
• Efficient subgraphs packing
• scientific article; zbMATH DE number 1022391
• Packing Digraphs with Directed Closed Trails
• Packing closed trails into dense graphs.
• Graph packings

Cited in

(3)

• Analyzing clustering and partitioning problems in selected VLSI models
• How to pack directed acyclic graphs into small blocks
• On a DAG partitioning problem

This page was built for publication: How to Pack Directed Acyclic Graphs into Small Blocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434563)