scientific article; zbMATH DE number 6469153
From MaRDI portal
Publication:5501266
zbMath1318.05084MaRDI QIDQ5501266
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
Counting Homomorphic Cycles in Degenerate Graphs ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication ⋮ Linear time algorithms for finding a dominating set of fixed size in degenerated graphs ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
This page was built for publication:
