{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:42Z","timestamp":1759638222974},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_27","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T01:31:44Z","timestamp":1188610304000},"page":"281-292","source":"Crossref","is-referenced-by-count":1,"title":["An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"27_CR2","first-page":"63","volume":"21","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Perfectly ordered graphs. Annals of Discrete Math.\u00a021, 63\u201365 (1984)","journal-title":"Annals of Discrete Math."},{"key":"27_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0166-218X(02)00499-7","volume":"128","author":"E.M. Eschen","year":"2003","unstructured":"Eschen, E.M., Johnson, J.L., Spinrad, J.P., Sritharan, R.: Recognition of some perfectly orderable graph classes. Discrete Appl. Math.\u00a0128, 355\u2013373 (2003)","journal-title":"Discrete Appl. Math."},{"key":"27_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(96)00008-X","volume":"73","author":"R. Hayward","year":"1997","unstructured":"Hayward, R.: Meyniel weakly triangulated graphs I: co-perfect orderability. Discrete Appl. Math.\u00a073, 199\u2013210 (1997)","journal-title":"Discrete Appl. Math."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)00162-7","volume":"66","author":"C.T. Ho\u00e0ng","year":"1996","unstructured":"Ho\u00e0ng, C.T.: On the complexity of recognizing a class of perfectly orderable graphs. Discrete Appl. Math.\u00a066, 219\u2013226 (1996)","journal-title":"Discrete Appl. Math."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/jgt.3190120310","volume":"12","author":"C.T. Ho\u00e0ng","year":"1988","unstructured":"Ho\u00e0ng, C.T., Khouzam, N.: On brittle graphs. J.\u00a0Graph Theory\u00a012, 391\u2013404 (1988)","journal-title":"J.\u00a0Graph Theory"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(00)00005-0","volume":"259","author":"C.T. Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng, C.T., Sritharan, R.: Finding houses and holes in graphs. Theoret. Comput. Sci.\u00a0259, 233\u2013244 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","unstructured":"McConnell, R.M., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation. In: Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1994), pp. 536\u2013545 (1994)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","volume":"80","author":"M. Middendorf","year":"1990","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of recognizing perfectly orderable graphs. Discrete Math.\u00a080, 327\u2013333 (1990)","journal-title":"Discrete Math."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-003-1075-9","volume":"39","author":"S.D. Nikolopoulos","year":"2004","unstructured":"Nikolopoulos, S.D., Palios, L.: Algorithms for P\n                4-comparability graph recognition and acyclic P\n                4-transitive orientation. Algorithmica\u00a039, 95\u2013126 (2004)","journal-title":"Algorithmica"},{"key":"27_CR13","first-page":"65","volume":"8","author":"S.D. Nikolopoulos","year":"2006","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs. Discrete Math. and Theoret. Comput. Sci.\u00a08, 65\u201382 (2006)","journal-title":"Discrete Math. and Theoret. Comput. Sci."},{"key":"27_CR14","unstructured":"Nikolopoulos, S.D., Palios, L.: An O(n m)-time Certifying Algorithm for Recognizing HHD-free Graphs, Technical Report TR-05-2007, Department of Computer Science, University of Ioannina (2007)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(89)90208-2","volume":"74","author":"S. Olariu","year":"1989","unstructured":"Olariu, S.: Weak bipolarizable graphs. Discrete Math.\u00a074, 159\u2013171 (1989)","journal-title":"Discrete Math."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73814-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:00:25Z","timestamp":1619503225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_27","relation":{},"subject":[]}}