Packing of (0, 1)-matrices

DOI10.1051/ita:2006037zbMath1110.68049OpenAlexW1982248677MaRDI QIDQ3423133

Stéphane Vialette

Publication date: 20 February 2007

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_4_519_0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

The \(S\)-\textsc{labeling} problem: an algorithmic tour, Population-based iterated greedy algorithm for the S-labeling problem, Algorithmic expedients for the \(S\)-labeling problem, On the S-Labeling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min Cut is NP-complete for edge weighted trees
• Optimal linear labelings and eigenvalues of graphs
• The NP-completeness of the bandwidth minimization problem
• Some simplified NP-complete graph problems
• On the complexity and approximation of syntenic distance
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Approximating Layout Problems on Random Geometric Graphs
• Minimizing the Profile of a Symmetric Matrix
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Topics in Intersection Graph Theory
• Graph Classes: A Survey