scientific article; zbMATH DE number 3636069

zbMATH Open0409.05040MaRDI QIDQ4196458FDOQ4196458

Authors: Robert E. Tarjan 

Publication date: 1974

Title of this publication is not available (Why is that?)

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)

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

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)