Header menu link for other important links
X
An optimal algorithm for finding frieze-kannan regular partitions
D. Dellamonica, , D.M. Martin, V. Rödl, A. Shapira
Published in Cambridge University Press
2015
Volume: 24
   
Issue: 2
Pages: 407 - 437
Abstract
In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze-Kannan regular. With a more refined version of these two local conditions we provide a deterministic algorithm that obtains a Frieze-Kannan regular partition of any graph G in time O(|V(G)|2). © 2014 Cambridge University Press.
About the journal
JournalData powered by TypesetCombinatorics Probability and Computing
PublisherData powered by TypesetCambridge University Press
ISSN09635483