✦ LIBER ✦

Generalization of a theorem on the parametric maximum flow problem

✍ Scribed by Tadashi Arai; Shuichi Ueno; Yoji Kajitani

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 338 KB
Volume: 41
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90245-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of chordal graphs and t

A generalization of chordal graphs and the maximum clique problem

✍ Assef Chmeiss; Philippe Jégou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 584 KB

A graph is chordal or triangulated if it has no chordless cycle with four or more vertices. Chordal graphs are well known for their combinatorial and algorithmic properties. Here we introduce a generalization of chordal graphs, namely CSGk graphs. Informally, a CSG' graph is a complete graph, and fo

On a generalization of the Gallai–Roy–Vi

On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem

✍ Bernard Gendron; Alain Hertz; Patrick St-Louis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

On the generalization of a theorem of A.

On the generalization of a theorem of A. Liapounoff

✍ Jürgen Moser 📂 Article 📅 1958 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

On a capacity scaling algorithm for the

On a capacity scaling algorithm for the constrained maximum flow problem

✍ Cenk Çalışkan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

Multi-parametric analysis of the maximum

Multi-parametric analysis of the maximum tolerance in a linear programming problem

✍ Hsiao-Fan Wang; Chen-Sheng Huang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 674 KB

On a generalization of the p-Center Prob

On a generalization of the p-Center Problem

✍ S.O. Krumke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 422 KB