An optimal algorithm for finding frieze-kannan regular partitions

Domingos Dellamonica; Subrahmanyam Kalyanasundaram; Daniel M. Martin; Vojtěch Rödl; Asaf Shapira

doi:10.1017/S0963548314000200

An optimal algorithm for finding frieze-kannan regular partitions

Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtěch Rödl, Asaf Shapira

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

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)|²).

Original language	English
Pages (from-to)	407-437
Number of pages	31
Journal	Combinatorics Probability and Computing
Volume	24
Issue number	2
DOIs	https://doi.org/10.1017/S0963548314000200
State	Published - 2 Mar 2015

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Statistics and Probability
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1017/S0963548314000200

Cite this

@article{dbdecd50cfe94b6fad6bcb0412639317,

title = "An optimal algorithm for finding frieze-kannan regular partitions",

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).",

author = "Domingos Dellamonica and Subrahmanyam Kalyanasundaram and Martin, {Daniel M.} and Vojt{\v e}ch R{\"o}dl and Asaf Shapira",

note = "Publisher Copyright: {\textcopyright} 2014 Cambridge University Press.",

year = "2015",

month = mar,

day = "2",

doi = "10.1017/S0963548314000200",

language = "الإنجليزيّة",

volume = "24",

pages = "407--437",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - An optimal algorithm for finding frieze-kannan regular partitions

AU - Dellamonica, Domingos

AU - Kalyanasundaram, Subrahmanyam

AU - Martin, Daniel M.

AU - Rödl, Vojtěch

AU - Shapira, Asaf

PY - 2015/3/2

Y1 - 2015/3/2

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=84922001971&partnerID=8YFLogxK

U2 - 10.1017/S0963548314000200

DO - 10.1017/S0963548314000200

M3 - مقالة

SN - 0963-5483

VL - 24

SP - 407

EP - 437

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 2

ER -

An optimal algorithm for finding frieze-kannan regular partitions

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this