参考文章(55)
Romuald Debruyne, Christian Bessière, From restricted path consistency to Max-Restricted Path Consistency principles and practice of constraint programming. pp. 312- 326 ,(1997) , 10.1007/BFB0017448
Kenneth W. Regan, Finitary Substructure Languages. structure in complexity theory annual conference. pp. 87- 96 ,(1989)
David Eppstein, Richard Beigel, 3-Coloring in time O(1.3446n): a no-MIS algorithm ,(2000)
Jaroslav Nešetřil, Svatopluk Poljak, On the complexity of the subgraph problem Commentationes Mathematicae Universitatis Carolinae. ,vol. 026, pp. 415- 419 ,(1985)
Romuald Debruyne, A property of path inverse consistency leading to an optimal PIC algorithm european conference on artificial intelligence. pp. 88- 92 ,(2000)
Rodney G. Downey, Michael R. Fellows, Ulrike Stege, Parameterized complexity: A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics. pp. 49- 100 ,(1997)
Béla Bollobás, Extremal Graph Theory ,(1978)
D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights european symposium on algorithms. pp. 320- 331 ,(1998) , 10.1007/3-540-68530-8_27
Mohammad A. Shokrollahi, Michael Clausen, Peter Brgisser, Algebraic Complexity Theory ,(1996)
Fabrizio Grandoni, Giuseppe F. Italiano, Improved algorithms for max-restricted path consistency principles and practice of constraint programming. pp. 858- 862 ,(2003) , 10.1007/978-3-540-45193-8_67