Arboricity and Subgraph Listing Algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Octagonal drawings of plane graphs with prescribed face areas
- On the thickness and arboricity of a graph
- Planar orientations with low out-degree and compaction of adjacency matrices
- Forests, frames, and games: Algorithms for matroid sums and applications
- An efficient parallel graph edge matching algorithm and its applications
- The maximum clique problem
- Arboricity and bipartite subgraph listing algorithms
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Fast recognition algorithms for classes of partial cubes
- Efficiently enumerating all maximal cliques with bit-parallelism
- iTri: index-based triangle listing in massive graphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Are unique subgraphs not easier to find?
- Efficient algorithms for subgraph listing
- A new decomposition technique for maximal clique enumeration for sparse graphs
- An efficient exact algorithm for triangle listing in large graphs
- Characterizing and recognizing 4-map graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Fast maximal cliques enumeration in sparse graphs
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Faster algorithms for counting subgraphs in sparse graphs
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- An efficient algorithm for 1-dimensional (Persistent) path homology
- Counting cliques in 1-planar graphs
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- A new algorithm for embedding plane graphs at fixed vertex locations
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Summarized bit batch-based triangle listing in massive graphs
- Querying relational event graphs using colored range searching data structures
- Online parameterized dictionary matching with one gap
- Online recognition of dictionary with one gap
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
- Approximation algorithms for clique transversals on some graph classes
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Computing median and antimedian sets in median graphs
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
- \(\mathsf{NIC}\)-planar graphs
- Mind the gap!
- On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
- Map graphs having witnesses of large girth
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- Counting subgraphs in relational event graphs
- Clique counting in MapReduce: algorithms and experiments
- Unique subgraphs are not easier to find
- Finding and counting small induced subgraphs efficiently
- Positional dominance: concepts and algorithms
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- Time windowed data structures for graphs
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- A constructive arboricity approximation scheme
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Dynamic set intersection
- Fast quasi-threshold editing
- Algorithms on Subtree Filament Graphs
- Arboricity, \(h\)-index, and dynamic algorithms
- Extended dynamic subgraph statistics using h-index parameterized data structures
- Recognizing IC-planar and NIC-planar graphs
- Approximately counting triangles in sublinear time
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Simultaneously load balancing for every p-norm, with reassignments
- On the characteristic polynomial of the power of a path
- Sublinear time estimation of degree distribution moments: the arboricity connection
- Why do simple algorithms for triangle enumeration work in the real world?
- On triangulating planar graphs under the four-connectivity constraint
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- On approximating the number of k-cliques in sublinear time
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Bounds and algorithms for graph trusses
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay
- Triangle listing algorithms: back from the diversion
- Domination problems on \(P_{5}\)-free graphs
- The communication complexity of set intersection and multiple equality testing
- Counting Subgraphs in Degenerate Graphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
- Computing dense and sparse subgraphs of weakly closed graphs
- Finding and counting small induced subgraphs efficiently
- A more compact visibility representation
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Finding small complete subgraphs efficiently
- Dominoes
- Finding large planar subgraphs and large subgraphs of a given genus
- The complexity of pattern counting in directed graphs, parameterised by the outdegree
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
- Finding and counting small tournaments in large tournaments
- Graphs whose vertices of degree at least 2 lie in a triangle
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Finding and counting given length cycles
- Towards optimal set-disjointness and set-intersection data structures
- A survey on the boxicity and cubicity of graphs
- Arboricity-dependent algorithms for edge coloring
- Join sampling under acyclic degree constraints and (cyclic) subgraph sampling
- Subgraph enumeration in optimal I/O complexity
- Computing eternal vertex cover number of maximal outerplanar graphs in linear time
- Graph threading
This page was built for publication: Arboricity and Subgraph Listing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690237)
