Polynomial time algorithm for min-ranks of graphs with simple tree structures
From MaRDI portal
Publication:2258079
DOI10.1007/s00453-013-9789-9zbMath1307.68057arXiv1304.6832OpenAlexW2107453037MaRDI QIDQ2258079
Publication date: 2 March 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6832
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- The strong perfect graph theorem
- A note on finding the bridges of a graph
- Orthogonal representations over finite fields and the chromatic number of graphs
- On the Shannon capacity of a graph
- Network information flow
- Index Coding With Side Information
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item