Transfer flow graphs
Publication:1801698
DOI10.1016/0012-365X(93)90488-FzbMath0768.68148MaRDI QIDQ1801698
Publication date: 20 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90488-f
cliques; NP-complete; polynomial time; combinatorial optimization problems; cograph; clique problem; compatibility graphs; transfer flow graphs
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C20: Directed graphs (digraphs), tournaments
Cites Work
- The ellipsoid method and its consequences in combinatorial optimization
- Parallel concepts in graph theory
- On a property of the class of n-colorable graphs
- The NP-completeness column: an ongoing guide
- The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item