Transfer flow graphs

DOI10.1016/0012-365X(93)90488-FzbMATH Open0768.68148OpenAlexW2074061244MaRDI QIDQ1801698FDOQ1801698

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)
• The NP-completeness column: an ongoing guide
• On a property of the class of n-colorable graphs
• Title not available (Why is that?)
• The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design

Cited In (1)

• Title not available (Why is that?)

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)