Coloring random graphs in polynomial expected time

Martin Furer, C. R. Subramanian, C. E.Veni Madhavan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Citations (Scopus)

    Abstract

    We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption ofconstant edge probability used in these models.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings
    EditorsFrancis Y.L. Chin, Prabhakar Raghavan, N.V. Balasubramanian, Kam Wing Ng
    PublisherSpringer Verlag
    Pages31-37
    Number of pages7
    ISBN (Print)9783540575689
    StatePublished - Jan 1 1993
    Event4th International Symposium on Algorithms and Computation, ISAAC 1993 - Hong Kong, China
    Duration: Dec 15 1993Dec 17 1993

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume762 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other4th International Symposium on Algorithms and Computation, ISAAC 1993
    CountryChina
    CityHong Kong
    Period12/15/9312/17/93

    Fingerprint

    Coloring
    Random Graphs
    Colouring
    Polynomials
    Polynomial
    Vertex Coloring
    Model
    Polynomial time
    Color
    Graph in graph theory

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Furer, M., Subramanian, C. R., & Madhavan, C. E. V. (1993). Coloring random graphs in polynomial expected time. In F. Y. L. Chin, P. Raghavan, N. V. Balasubramanian, & K. W. Ng (Eds.), Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings (pp. 31-37). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 762 LNCS). Springer Verlag.
    Furer, Martin ; Subramanian, C. R. ; Madhavan, C. E.Veni. / Coloring random graphs in polynomial expected time. Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. editor / Francis Y.L. Chin ; Prabhakar Raghavan ; N.V. Balasubramanian ; Kam Wing Ng. Springer Verlag, 1993. pp. 31-37 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{654d810800844d5aa288e16e9b20edb7,
    title = "Coloring random graphs in polynomial expected time",
    abstract = "We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption ofconstant edge probability used in these models.",
    author = "Martin Furer and Subramanian, {C. R.} and Madhavan, {C. E.Veni}",
    year = "1993",
    month = "1",
    day = "1",
    language = "English (US)",
    isbn = "9783540575689",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "31--37",
    editor = "Chin, {Francis Y.L.} and Prabhakar Raghavan and N.V. Balasubramanian and Ng, {Kam Wing}",
    booktitle = "Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings",
    address = "Germany",

    }

    Furer, M, Subramanian, CR & Madhavan, CEV 1993, Coloring random graphs in polynomial expected time. in FYL Chin, P Raghavan, NV Balasubramanian & KW Ng (eds), Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 762 LNCS, Springer Verlag, pp. 31-37, 4th International Symposium on Algorithms and Computation, ISAAC 1993, Hong Kong, China, 12/15/93.

    Coloring random graphs in polynomial expected time. / Furer, Martin; Subramanian, C. R.; Madhavan, C. E.Veni.

    Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. ed. / Francis Y.L. Chin; Prabhakar Raghavan; N.V. Balasubramanian; Kam Wing Ng. Springer Verlag, 1993. p. 31-37 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 762 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Coloring random graphs in polynomial expected time

    AU - Furer, Martin

    AU - Subramanian, C. R.

    AU - Madhavan, C. E.Veni

    PY - 1993/1/1

    Y1 - 1993/1/1

    N2 - We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption ofconstant edge probability used in these models.

    AB - We consider the problem of vertex coloring random k-colorable graphs using k colors. We consider two different models for generating random graphs. We give algorithms for coloring random graphs in these models, with running times polynomial on the average. The first model is discussed in Turner [6] and the second model is discussed in Dyer and Frieze [3]. Our results improve the these current results for this problem by removing the assumption ofconstant edge probability used in these models.

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

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

    M3 - Conference contribution

    AN - SCOPUS:84949825861

    SN - 9783540575689

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 31

    EP - 37

    BT - Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings

    A2 - Chin, Francis Y.L.

    A2 - Raghavan, Prabhakar

    A2 - Balasubramanian, N.V.

    A2 - Ng, Kam Wing

    PB - Springer Verlag

    ER -

    Furer M, Subramanian CR, Madhavan CEV. Coloring random graphs in polynomial expected time. In Chin FYL, Raghavan P, Balasubramanian NV, Ng KW, editors, Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Springer Verlag. 1993. p. 31-37. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).