Sparse Square Roots
From MaRDI portal
Publication:2864300
DOI10.1007/978-3-642-45043-3_16zbMath1331.05204OpenAlexW93588244MaRDI QIDQ2864300
Petr A. Golovach, Manfred Cochefert, Dieter Kratsch, Daniël Paulusma, Jean-François Couturier
Publication date: 6 December 2013
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/14181/1/14181.pdf
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items
A linear kernel for finding square roots of almost planar graphs, Computing square roots of graphs with low maximum degree, Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs, Squares of low clique number, Finding Cactus Roots in Polynomial Time, Parameterized algorithms for finding square roots