scientific article; zbMATH DE number 1116645

zbMATH Open0891.68073MaRDI QIDQ4376325FDOQ4376325

Xuanxi Ning

Publication date: 10 February 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

graph simplex algorithmminimal flow problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• The minimum spanning flow in a network and its self‐organization principle
• Network simplex algorithm for the general equal flow problem.

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimal blocking flow in networks 👍 👎
• Title not available (Why is that?) 👍 👎

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