scientific article; zbMATH DE number 5060433

MaRDI QIDQ5490907zbMATH OpenFDO

Authors Xuanxi Ning, Angelika Ning

Publication date 4 October 2006

Full work available at URL http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-5301-1

zbMATH Keywords

blocking flowgraphnetwork

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4160773
• The computational complexity of optimal blocking of vertices in the digraph
• On Hamiltonian colorings of block graphs
• A heuristic for blocking flow algorithms
• The \(p\)-maxian problem on block graphs
• A parallel algorithm for finding a blocking flow in an acyclic network
• Hamilton cycles in restricted block-intersection graphs
• A parallel blocking flow algorithm for acyclic networks
• scientific article; zbMATH DE number 7650254
• Blockers for simple Hamiltonian paths in convex geometric graphs of even order

Cited in

(1)

• The minimum spanning flow in a network and its self‐organization principle

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 Q5490907)