Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
DOI10.1007/S00453-015-9998-5zbMATH Open1339.68342OpenAlexW2101318995MaRDI QIDQ289909FDOQ289909
Authors: Ulrich Laube, Markus E. Nebel 
Publication date: 31 May 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-9998-5
Recommendations
analysis of algorithmsgenerating functionsrandom geometric graphsaverage caseFord-Fulkerson maxflowgrid graphsmaximum likelihood analysisstochastic context free grammars
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Graph representations (geometric and intersection representations, etc.) (05C62) Grammars and rewriting systems (68Q42)
Cites Work
- Random Geometric Graphs
- Title not available (Why is that?)
- Analytic combinatorics
- Random Graphs
- Title not available (Why is that?)
- R. A. Fisher and the making of maximum likelihood 1912--1922
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Beyond the flow decomposition barrier
- Order Statistics
- Max flows in \(O(nm)\) time, or better
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum likelihood analysis of algorithms and data structures
- Average-case analysis of algorithms for matchings and related problems
- A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289909)
