Transversals of subtree hypergraphs and the source location problem in digraphs

DOI10.1002/NET.20206MaRDI QIDQ5449666zbMATH OpenOpenAlexFDO

Authors Jan van den Heuvel, Matthew Johnson

Publication date 12 March 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/1920/1/1920.pdf

zbMATH Keywords

hypertreepolynomial algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Discrete location and assignment (90B80)

Recommendations

• Source location in undirected and directed hypergraphs
• Minimum Transversals in Posi-modular Systems
• scientific article; zbMATH DE number 2152473
• Minimum transversals in posimodular systems
• An algorithm for source location in directed graphs

Cited in

(12)

• Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
• An algorithm for source location in directed graphs
• Minimum cost source location problems with flow requirements
• Wiener Index of Hypertree
• Minimum transversals in posimodular systems
• Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
• Minimum Transversals in Posi-modular Systems
• Multi-commodity Source Location Problems and Price of Greed
• Dominated coloring in certain trees
• Source location with rigidity and tree packing requirements
• Static and dynamic source locations in undirected networks
• Source location in undirected and directed hypergraphs

This page was built for publication: Transversals of subtree hypergraphs and the source location problem in digraphs

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