A connectivity constraint using bridges

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 707-708

  Prosser, Patrick ^a   Unsworth, Chris ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80053019388     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (5)

1. Ken Brown, Patrick Prosser, J. Christopher Beck, and ChristineWu, 'Exploring the use of constraint programming for enforcing connectivity during graph generation', in The 5th workshop on modelling and solving problems with constraints (held at IJCAI05), (2005).
2. T.H. Corman, C.E. Leirson, and R.L. Rivest, Introduction to Algorithms, Sept 2001.
3. Gregorie Dooms, Yves Deville, and Pierre Dupont, 'CP(Graph): Introducing a Graph Computation Domain in Constraint Programming', in CP2005 (LNCS 3709), (2005).
4. Ian P. Gent, Patrick Prosser, Barbara M. Smith, and Christine Wu Wei, 'Supertree Construction with Constraint Programming', in CP2003 (LNCS 2833), (2003).
5. R. Endre Tarjan, 'A note on finding the bridges of a graph', Information Processing Letters, 2, 160-161, (1974).