Listing all maximal cliques in large sparse real-world graphs
We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to
choose more carefully the order in which the vertices are processed, giving us a fixed …
choose more carefully the order in which the vertices are processed, giving us a fixed …
Listing all maximal cliques in sparse graphs in near-optimal time
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …
[图书][B] Handbook of graph drawing and visualization
R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Subgraph isomorphism in planar graphs and related problems
D Eppstein - Graph Algorithms and Applications I, 2002 - World Scientific
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern
of constant size. Our results are based on a technique of partitioning the planar graph into …
of constant size. Our results are based on a technique of partitioning the planar graph into …
Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations
TJ Barth - AGARD, special course on unstructured grid methods …, 1992 - ntrs.nasa.gov
One of the major achievements in engineering science has been the development of
computer algorithms for solving nonlinear differential equations such as the Navier-Stokes …
computer algorithms for solving nonlinear differential equations such as the Navier-Stokes …
Numerical aspects of computing high Reynolds number flows on unstructured meshes
T Barth - 29th Aerospace Sciences Meeting, 1991 - arc.aiaa.org
Various numerical and practical aspects associated with the solution of the Navier-Stokes
equations on triangular meshes are addressed. We depart from the standard “element” data …
equations on triangular meshes are addressed. We depart from the standard “element” data …
Fully dynamic algorithms for maintaining shortest paths trees
We propose fully dynamic algorithms for maintaining the distances and the shortest paths
from a single source in either a directed or an undirected graph with positive real edge …
from a single source in either a directed or an undirected graph with positive real edge …
Arboricity and bipartite subgraph listing algorithms
D Eppstein - Information processing letters, 1994 - Elsevier
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite
subgraphs is O (n). We described a linear time algorithm to list such subgraphs. The …
subgraphs is O (n). We described a linear time algorithm to list such subgraphs. The …
Graphminesuite: Enabling high-performance and programmable graph mining algorithms with set algebra
M Besta, Z Vonarburg-Shmaria, Y Schaffner… - arXiv preprint arXiv …, 2021 - arxiv.org
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that
facilitates evaluating and constructing high-performance graph mining algorithms. First …
facilitates evaluating and constructing high-performance graph mining algorithms. First …
High-performance parallel graph coloring with strong guarantees on work, depth, and quality
M Besta, A Carigiet, K Janda… - … Conference for High …, 2020 - ieeexplore.ieee.org
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on
work and depth and coloring quality. The key idea is to design a relaxation of the vertex …
work and depth and coloring quality. The key idea is to design a relaxation of the vertex …