Finding a minimum equivalent graph of a digraph

DOI10.1002/net.3230120202zbMath0484.68049OpenAlexW2025742807MaRDI QIDQ3944018

Silvano Martello, Paolo Toth

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120202

zbMATH Keywords

reduction procedurebranch and bound searchremoving the maximum number of edges from a digraph without affecting its reachability propertiesworst-case performance of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

The point-to-point connection problem - analysis and algorithms ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Steiner problems on directed acyclic graphs ⋮ Two variations of the minimum Steiner problem

Cites Work

• Computationally Related Problems
• A Theorem on Boolean Matrices

This page was built for publication: Finding a minimum equivalent graph of a digraph