Maximum likelihood analysis of the Ford-Fulkerson method on special graphs

DOI10.1007/S00453-015-9998-5zbMATH Open1339.68342OpenAlexW2101318995MaRDI QIDQ289909FDOQ289909

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

zbMATH Keywords

analysis of algorithmsgenerating functionsrandom geometric graphsaverage caseFord-Fulkerson maxflowgrid graphsmaximum likelihood analysisstochastic context free grammars

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Geometric Graphs
• Random Graphs
• R. A. Fisher and the making of maximum likelihood 1912--1922
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Beyond the flow decomposition barrier
• Order Statistics
• Max flows in O(nm) time, or better
• 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

Uses Software

• MaLiJAn

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)