Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710065
DOI10.1007/b136461zbMath1121.68360OpenAlexW2485841483MaRDI QIDQ5710065
Dorothea Wagner, Thomas Schank
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Related Items (33)
Impact of structural balance on self-avoiding pruning walk ⋮ A second look at counting triangles in graph streams (corrected) ⋮ iTri: index-based triangle listing in massive graphs ⋮ Efficient Computation of the Weighted Clustering Coefficient ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Approximately Counting Triangles in Sublinear Time ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ Summarized bit batch-based triangle listing in massive graphs ⋮ Unnamed Item ⋮ On Approximating the Number of $k$-Cliques in Sublinear Time ⋮ Are unique subgraphs not easier to find? ⋮ A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Practical Minimum Cut Algorithms ⋮ Efficient algorithms for subgraph listing ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ A fast deterministic detection of small pattern graphs in graphs without large cliques ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ A framework for second-order eigenvector centralities and clustering coefficients ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Discretization orders for distance geometry problems ⋮ Detecting and Counting Small Pattern Graphs ⋮ The maximum number of induced open triangles in graphs of a given order ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Parameterized aspects of triangle enumeration ⋮ On the characteristic polynomial of the power of a path. ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ A second look at counting triangles in graph streams ⋮ Rare siblings speed-up deterministic detection and counting of small pattern graphs ⋮ Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? ⋮ Complex network filtering and compression algorithm based on triangle-subgraph ⋮ Efficient computation of the Weighted Clustering Coefficient ⋮ On the maximum number of open triangles in graphs with the same number of vertices and edges
This page was built for publication: Experimental and Efficient Algorithms
