Pages that link to "Item:Q2817625"
From MaRDI portal
The following pages link to Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) (Q2817625):
Displaying 21 items.
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
- The existence of homeomorphic subgraphs in chordal graphs (Q1372257) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Finding even cycles even faster (Q4632454) (← links)
- Recognizing small subgraphs (Q4861348) (← links)
- (Q5091015) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902529) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
