Opening book details…
Can I read Finding Houses and Holes in Graphs on EtoBox?
Finding Houses and Holes in Graphs by Chı́nh T. Hoàng; R. Sritharan is a Computer Science article available to read on EtoBox.
What is Finding Houses and Holes in Graphs about?
A house is the complement of an induced path on ÿve vertices. A hole is an induced cycle on ÿve or more vertices. A domino is the cycle on six vertices with a long chord. A graph is HH-free if it does not contain a house or a hole. A graph is HHD-free if it does not contain a house, or a hole, or a domino. We present O(n 3 ) algorithms to recognize HH-free graphs and HHD-free graphs. The previous best algorithms for the problems run in O(n 4 ) time.
Who reads Finding Houses and Holes in Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Chı́nh T. Hoàng; R. Sritharan
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
- Published
- 2001
- Language
- EN
- Field
- Computer Science (Physical Sciences)