Searching for "The Directed Subgraph Homeomorphism Problem." – sorted by Relevance.
-
The Complexity of Constraints on Intervals and Lengths
- Subgraph Homeomorphism problem [25]. Constraint satisfaction problems have been a fruitful source
- Cited by 1 (1 self) – Add To MetaCart
-
survivable
- ,j) ∈ A. The directed survivable network design problem (directed SND) seeks a minimum weight subgraph
- Add To MetaCart
-
Contents
- . Fortune, J. E. Hopcroft and J. C. Wyllie, The Directed Subgraph Homeomorphism Problem. Theor. Comp. Sci
- Add To MetaCart

