Transfer flow graphs

DOI10.1016/0012-365X(93)90488-FzbMath0768.68148OpenAlexW2074061244MaRDI QIDQ1801698

Klaus Jansen

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

zbMATH Keywords

cliquesNP-completepolynomial timecombinatorial optimization problemscographclique problemcompatibility graphstransfer flow graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

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

This page was built for publication: Transfer flow graphs