Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1122.05079OpenAlexW2491671784MaRDI QIDQ5492948

Dieter Mitsche, Joachim Giesen

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

A simple spectral algorithm for recovering planted partitions ⋮ Recovering nonuniform planted partitions via iterated projection ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes

This page was built for publication: Fundamentals of Computation Theory