Pages that link to "Item:Q3690237"
From MaRDI portal
The following pages link to Arboricity and Subgraph Listing Algorithms (Q3690237):
Displaying 50 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Finding squares and rectangles in sets of points (Q802873) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- On the thickness and arboricity of a graph (Q1121907) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- The maximum clique problem (Q1318271) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- iTri: index-based triangle listing in massive graphs (Q1671265) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- Fast maximal cliques enumeration in sparse graphs (Q1949748) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- An efficient algorithm for 1-dimensional (Persistent) path homology (Q2105324) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Summarized bit batch-based triangle listing in massive graphs (Q2195476) (← links)
- Querying relational event graphs using colored range searching data structures (Q2201770) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
