Transfer flow graphs

DOI10.1016/0012-365X(93)90488-FMaRDI QIDQ1801698zbMATH OpenOpenAlexFDO

Authors 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

NP-completepolynomial timecombinatorial optimization problemscliquescographclique problemcompatibility graphstransfer flow graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4197386
• Restrictions of graph partition problems. I
• The allocation problem in hardware design
• Processor optimization for flow graphs
• Publication:3490013

Cites work

• scientific article; zbMATH DE number 3851153 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On a property of the class of n-colorable graphs
• Parallel concepts in graph theory
• The NP-completeness column: an ongoing guide
• The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(1)

• scientific article; zbMATH DE number 1933252 (Why is no real title available?)

This page was built for publication: Transfer flow graphs

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