Pages that link to "Item:Q294749"
From MaRDI portal
The following pages link to Finding and counting small induced subgraphs efficiently (Q294749):
Displaying 35 items.
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs (Q2227542) (← links)
- Free fermions behind the disguise (Q2244922) (← links)
- About some robustness and complexity properties of \(G\)-graphs networks (Q2255041) (← links)
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- Counting Subgraphs in Relational Event Graphs (Q2803823) (← links)
- Unique subgraphs are not easier to find (Q2855752) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
- Time Windowed Data Structures for Graphs (Q3121517) (← links)
- (Q3121527) (← links)
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- (Q5090377) (← links)
- (Q5091007) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
