Searching for "Contractible Subgraphs" – sorted by Relevance.
-
Contractible Subgraphs in k-Connected Graphs ∗
- Contractible Subgraphs in k-Connected Graphs ∗ Zemin Jin 1 Xingxing Yu 1,2 Xiaoyan Zhang 1 1
- Add To MetaCart
-
On Stability of the Hamiltonian Index under Contractions and Closures
- this result to prove that neither the contraction of an AG (F)-contractible subgraph F of a graph G nor
- Add To MetaCart
-
Visual Navigation of Compound Graphs
- by contracting subgraphs into meta nodes. Starting with an initial view, the underlying compound graph
- Cited by 1 (0 self) – Add To MetaCart
-
Dynamic Tree Cross Products
- from a large base graph by the contraction of subgraphs defined recursively by an associated hierarchy
- Cited by 1 (1 self) – Add To MetaCart
-
Finding Minimum Spanning Trees in O(m α(m,n)) Time
- information about the MST by certifying that regions of the graph are contractible. We say that a subgraph C
- Add To MetaCart
-
Lightpaths Routing for Single Link Failure Survivability in IP-over-WDM Networks
- in the contracted subgraph is also routable in a survivable manner, then the subgraph of the logical topology
- Cited by 1 (1 self) – Add To MetaCart
-
Lower bound for sparse euclidean spanners
- that all light vertices � . By contracting the induced subgraph of each � , we obtain a new ��� � from
- Cited by 2 (0 self) – Add To MetaCart
-
An optimal minimum spanning tree algorithm
- endpoints appropriately. Definition 3.1. A subgraph C is said to be DJP-contractible with respect to G
- Cited by 34 (10 self) – Add To MetaCart
-
I/O-Efficient Planar Separators and Applications
- if w(v) +w(w) r i and s(v) +s(w) 56. The contractible subgraph H 0 of G 0 i is the graph induced
- Cited by 3 (1 self) – Add To MetaCart
-
Survivability aware routing of logical topologies: On Thiran-Kurant approach, evaluation and enhancements
- for it in the physical topology, which is survivable. If such a mapping is found, then the subgraph is contracted
- Cited by 1 (1 self) – Add To MetaCart

