Transfer flow graphs
From MaRDI portal
clique problemcliquescographcombinatorial optimization problemscompatibility graphsNP-completepolynomial timetransfer flow graphs
Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
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 ellipsoid method and its consequences in combinatorial optimization
- The NP-completeness column: an ongoing guide
- The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design
Cited in
(2)
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)