### 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 language | English (US) |
---|---|

Title of host publication | Foundations of Software Technology and Theoretical Computer Science - 17th Conference, 1997, Proceedings |

Editors | S. Ramesh, G. Sivakumar |

Publisher | Springer-Verlag |

Pages | 37-53 |

Number of pages | 17 |

ISBN (Print) | 3540638768, 9783540638766 |

State | Published - Jan 1 1997 |

Event | 17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997 - Kharagpur, India Duration: Dec 18 1997 → Dec 20 1997 |

### Publication series

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

Volume | 1346 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 17th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1997 |
---|---|

Country | India |

City | Kharagpur |

Period | 12/18/97 → 12/20/97 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -