Graph editing to bipartite interval graphs: Exact and asymptotic bounds

K. Cirino, Shanmugavelayutham Muthukrishnan, N. S. Narayanaswamy, H. Ramesh

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

    Abstract

    Graph editing problems deal with the complexity of transforming a given input graph G from class g to any graph H in the target class H by adding and deleting edges. Motivated by a physical mapping scenario in Computational Biology, we consider graph editing to the class of bipartite interval graphs (BIGs). We prove asymptotic and exact bounds on the minimum number of editions needed to convert a graph into a BIG.

    Original languageEnglish (US)
    Title of host publicationFoundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings
    EditorsS. Ramesh, G. Sivakumar
    PublisherSpringer-Verlag
    Pages37-53
    Number of pages17
    ISBN (Print)3540638768, 9783540638766
    StatePublished - Jan 1 1997
    Event17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997 - Kharagpur, India
    Duration: Dec 18 1997Dec 20 1997

    Publication series

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

    Conference

    Conference17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997
    CountryIndia
    CityKharagpur
    Period12/18/9712/20/97

    Fingerprint

    Interval Graphs
    Bipartite Graph
    Graph in graph theory
    Computational Biology
    Convert
    Scenarios
    Target
    Class

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Cirino, K., Muthukrishnan, S., Narayanaswamy, N. S., & Ramesh, H. (1997). Graph editing to bipartite interval graphs: Exact and asymptotic bounds. In S. Ramesh, & G. Sivakumar (Eds.), Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings (pp. 37-53). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1346). Springer-Verlag.

    Graph editing to bipartite interval graphs : Exact and asymptotic bounds. / Cirino, K.; Muthukrishnan, Shanmugavelayutham; Narayanaswamy, N. S.; Ramesh, H.

    Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings. ed. / S. Ramesh; G. Sivakumar. Springer-Verlag, 1997. p. 37-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1346).

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

    Cirino, K, Muthukrishnan, S, Narayanaswamy, NS & Ramesh, H 1997, Graph editing to bipartite interval graphs: Exact and asymptotic bounds. in S Ramesh & G Sivakumar (eds), Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1346, Springer-Verlag, pp. 37-53, 17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997, Kharagpur, India, 12/18/97.
    Cirino K, Muthukrishnan S, Narayanaswamy NS, Ramesh H. Graph editing to bipartite interval graphs: Exact and asymptotic bounds. In Ramesh S, Sivakumar G, editors, Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings. Springer-Verlag. 1997. p. 37-53. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Cirino, K. ; Muthukrishnan, Shanmugavelayutham ; Narayanaswamy, N. S. ; Ramesh, H. / Graph editing to bipartite interval graphs : Exact and asymptotic bounds. Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings. editor / S. Ramesh ; G. Sivakumar. Springer-Verlag, 1997. pp. 37-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{6df87e2ca09649bfa60d7d63e370b7db,
    title = "Graph editing to bipartite interval graphs: Exact and asymptotic bounds",
    abstract = "Graph editing problems deal with the complexity of transforming a given input graph G from class g to any graph H in the target class H by adding and deleting edges. Motivated by a physical mapping scenario in Computational Biology, we consider graph editing to the class of bipartite interval graphs (BIGs). We prove asymptotic and exact bounds on the minimum number of editions needed to convert a graph into a BIG.",
    author = "K. Cirino and Shanmugavelayutham Muthukrishnan and Narayanaswamy, {N. S.} and H. Ramesh",
    year = "1997",
    month = "1",
    day = "1",
    language = "English (US)",
    isbn = "3540638768",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "37--53",
    editor = "S. Ramesh and G. Sivakumar",
    booktitle = "Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings",

    }

    TY - GEN

    T1 - Graph editing to bipartite interval graphs

    T2 - Exact and asymptotic bounds

    AU - Cirino, K.

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Narayanaswamy, N. S.

    AU - Ramesh, H.

    PY - 1997/1/1

    Y1 - 1997/1/1

    N2 - Graph editing problems deal with the complexity of transforming a given input graph G from class g to any graph H in the target class H by adding and deleting edges. Motivated by a physical mapping scenario in Computational Biology, we consider graph editing to the class of bipartite interval graphs (BIGs). We prove asymptotic and exact bounds on the minimum number of editions needed to convert a graph into a BIG.

    AB - Graph editing problems deal with the complexity of transforming a given input graph G from class g to any graph H in the target class H by adding and deleting edges. Motivated by a physical mapping scenario in Computational Biology, we consider graph editing to the class of bipartite interval graphs (BIGs). We prove asymptotic and exact bounds on the minimum number of editions needed to convert a graph into a BIG.

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

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

    M3 - Conference contribution

    AN - SCOPUS:84949197136

    SN - 3540638768

    SN - 9783540638766

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

    SP - 37

    EP - 53

    BT - Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings

    A2 - Ramesh, S.

    A2 - Sivakumar, G.

    PB - Springer-Verlag

    ER -