Searching for "On graph closures." – sorted by Relevance.
-
Closure-Tree: An Index Structure for Graph Queries
- Closure-Tree: An Index Structure for Graph Queries Abstract Graphs have become popular
- Add To MetaCart
-
Computation and Presentation of Graphs Displaying Closure Hierarchies of Jordan and Kronecker
- using nlaauth.cls [Version: 2000/03/22 v1.0] Computation and Presentation of Graphs Displaying Closure
- Cited by 4 (2 self) – Add To MetaCart
-
Strengthening the Closure Concept in Claw-Free Graphs
- Strengthening the closure concept in claw-free graphs Hajo Broersma Faculty of Mathematical
- Cited by 47 (11 self) – Add To MetaCart
-
Every 3-connected, essentially 11-connected line graph is hamiltonian, submitted
- ˘cek’s line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph
- Cited by 1 (1 self) – Add To MetaCart
-
Redefining Web-of-Trust: reputation, recommendations, responsibility and trust among peers
- . Different from the classic web-oftrust (i.e. trust relationships graph closure), the proposed method relies
- Cited by 1 (0 self) – Add To MetaCart
-
Extending The Take-Grant Protection System
- graph or closure and the complexity of generating witnesses from the closure graph. We discuss the use
- Cited by 9 (2 self) – Add To MetaCart
-
On some intriguing problems in Hamiltonian graph theory - A survey
- , line graph, cubic graph, closure, hopping lemma, cyclically 4-edge-connected, essentially 4-edge
- Cited by 2 (1 self) – Add To MetaCart
-
Limits to Parallel Computation: P-Completeness Theory
- of Problems 117 A P -Complete Problems 119 A.1 Circuit Complexity 121 A.2 Graph Theory 128 A.3 Searching
- Cited by 113 (4 self) – Add To MetaCart
-
Spectral Theory Of Elliptic Operators On Non-Compact Manifolds
- (A). Then G A = GA , i.e. the graph of A is the closure of the graph of A. Moreover A = A = (A
- Cited by 22 (9 self) – Add To MetaCart
-
The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata
- hierarchy coincides with the family of graphs obtained as the ε-closure of configuration graphs of higher
- Cited by 26 (2 self) – Add To MetaCart

