Li, X.Y. & Stallmann, M. (2002) New bounds on the barycenter heuristic for bipartite graphs. Inf. Process. Lett. 82, pp. 293-298. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Barycenter Heuristic and the Reorderable Matrix - Mäkinen, al. (2005) (Correct)
No context found.
Li, X.Y. & Stallmann, M. (2002) New bounds on the barycenter heuristic for bipartite graphs. Inf. Process. Lett. 82, pp. 293-298.
The Barycenter Heuristic and the Reorderable Matrix - Mäkinen, Siirtola (2005) (Correct)
No context found.
Li, X.Y. & Stallmann, M. (2002) New bounds on the barycenter heuristic for bipartite graphs. Inf. Process. Lett. 82, pp. 293-298.
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