{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:18:59Z","timestamp":1725815939407},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_15","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"150-156","source":"Crossref","is-referenced-by-count":0,"title":["Tree Path Labeling of Hypergraphs \u2013 A Generalization of the Consecutive Ones Property"],"prefix":"10.1007","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[]},{"given":"Anju","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Atkins, J.E., Boman, E.G., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SICOMP: SIAM Journal on Computing\u00a028 (1998)","DOI":"10.1137\/S0097539795285771"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences\u00a013(3), 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0095-8956(72)90058-5","volume":"13","author":"C. Berge","year":"1972","unstructured":"Berge, C., Rado, R.: Note on isomorphic hypergraphs and whitney\u2019s theorem to families of sets. Journal of Combinatorial Theory (B)\u00a013, 226\u2013241 (1972)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac.\u00a0J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pac.\u00a0J. Math."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0095-8956(80)90089-1","volume":"29","author":"J.C. Fournier","year":"1980","unstructured":"Fournier, J.C.: lsomorphismes dhypergraphes par intersections equicardinales daretes et configurations exclues. Journal of Combinatorial Theory (B)\u00a029, 321\u2013327 (1980)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. Elsevier Science B.V. (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.disopt.2006.02.002","volume":"3","author":"D.S. Hochbaum","year":"2006","unstructured":"Hochbaum, D.S., Levin, A.: Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optimization\u00a03(4), 327\u2013340 (2006)","journal-title":"Discrete Optimization"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44679-6_23","volume-title":"Computing and Combinatorics","author":"W.-L. Hsu","year":"2001","unstructured":"Hsu, W.-L.: PC-Trees vs. PQ-Trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 207\u2013217. Springer, Heidelberg (2001)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2001.1205","volume":"43","author":"W.-L. Hsu","year":"2002","unstructured":"Hsu, W.-L.: A simple test for the consecutive ones property. J. Algorithms\u00a043(1), 1\u201316 (2002)","journal-title":"J. Algorithms"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hochbaum, D., Tucker, A.: Minimax problems with bitonic matrices. NETWORKS: Networks: An International Journal\u00a040 (2002)","DOI":"10.1002\/net.10038"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/0206004","volume":"6","author":"L.T. Kou","year":"1977","unstructured":"Kou, L.T.: Polynomial complete consecutive information retrieval problems. SIAM Journal on Computing\u00a06(1), 67\u201375 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR12","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (2004)"},{"key":"15_CR13","unstructured":"Meidanis, J., Munuera, E.G.: A theory for the consecutive ones property. In: Proceedings of WSP 1996 - Third South American Workshop on String Processing, pp. 194\u2013202 (1996)"},{"issue":"18","key":"15_CR14","doi-asserted-by":"publisher","first-page":"3721","DOI":"10.1016\/j.dam.2009.08.001","volume":"157","author":"N.S. Narayanaswamy","year":"2009","unstructured":"Narayanaswamy, N.S., Subashini, R.: A new characterization of matrices with the consecutive ones property. Discrete Applied Mathematics\u00a0157(18), 3721\u20133727 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"W.S. Robinson","year":"1951","unstructured":"Robinson, W.S.: A method for chronologically ordering archaeological deposits. American Antiquity\u00a016(4), 293\u2013301 (1951)","journal-title":"American Antiquity"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","volume":"12","author":"A. Tucker","year":"1972","unstructured":"Tucker, A.: A structure theorem for the consecutive 1\u2019s property. J. Comb.\u00a0Theory Series B\u00a012, 153\u2013162 (1972)","journal-title":"J. Comb.\u00a0Theory Series B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T04:58:56Z","timestamp":1559105936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}