Hiroshi Nagamochi and Toshihide Ibaraki. Graph connectivity and its augmentation: applications of ma orderings. Discrete Appl. Math., 123(1-3):447--472, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Certificate Recommendations to Improve - The Robustness Of (Correct)
No context found.
Hiroshi Nagamochi and Toshihide Ibaraki. Graph connectivity and its augmentation: applications of ma orderings. Discrete Appl. Math., 123(1-3):447--472, 2002.
Sparse Certificates And Removable Cycles In L-Mixed.. - Berg, Jordan (2004) (Correct)
No context found.
H. Nagamochi, T. Ibaraki, Graph connectivity and its augmentation: applications of MA orderings, Discrete Applied Math. 123 (2002), 447-472.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC