scientific article; zbMATH DE number 3636069

MaRDI QIDQ4196458zbMATH OpenFDO

Authors Robert E. Tarjan

Publication date 1974

zbMATH Keywords

Graph Connectivity AlgorithmMaximum Bipartite Matching AlgorithmMaximum Flow Algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(6)

• A note on degree-constrained star subgraphs of bipartite graphs
• Cycles and paths in bipartite tournaments with spanning configurations
• Analyse und Synthese zuverlässiger Netze
• A good algorithm for edge-disjoint branching
• The subgraph homeomorphism problem
• Round-optimal perfectly secret message transmission with linear communication complexity

This page was built for publication:

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