J. Spinrad, Finding large holes, Inform. Process. Lett. 39 (1991) 227--229. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Recognizing Weakly Triangulated Graphs by Edge Separability - Berry, Bordat, al. (2000) (6 citations) (Correct)
....This work was supported in part by The Research Council of Norway. An earlier version of this paper appeared in [7] 2 ANNE BERRY, JEAN PAUL BORDAT, PINAR HEGGERNES presence of a hole in the graph and then in its complement. This was improved to O(n 4:376 ) by Spinrad s hole finding procedure [21]. In order to give a different characterization of weakly triangulated graphs, Hayward, Ho ang, and Maffray [16] introduced the notion of a 2 pair : a pair fa; bg of non adjacent vertices such that every chordless path from a to b has exactly two edges. Arikati and Rangan [1] gave an efficient ....
Spinrad, J. 1991. Finding large holes. Information Processing Letters 39, 227-- 229.
On Stable Cutsets in Graphs - Brandstädt, Dragan, Le, Szymczak (2000) (8 citations) (Correct)
No context found.
J. Spinrad, Finding large holes, Inform. Process. Lett. 39 (1991) 227--229.
Hole and Antihole Detection in Graphs - Stavros Nikolopoulos Leonidas (2004) (1 citation) (Correct)
No context found.
J.P. Spinrad, Finding large holes, Inform. Process. Letters 39, 227--229, 1991.
Parallel Algorithms for Recognizing P_5-free and ...-free.. - Nikolopoulos, Palios (Correct)
No context found.
J.P. Spinrad, Finding large holes, Inform. Process. Letters 39, 227-229, 1991.
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