{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:24:48Z","timestamp":1649129088968},"reference-count":24,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p> A graph is a directed path overlap graph if it is the overlap graph of family of directed paths in a rooted directed tree. A graph is a multiclique if its connected components are cliques. A graph is a complete multipartite graph if it is the complement of a multiclique. A graph is a multiclique-multipartite graph if its vertex set has a partition [Formula: see text], [Formula: see text] such that [Formula: see text] is complete multipartite, [Formula: see text] is a multiclique and every two vertices [Formula: see text], [Formula: see text] are adjacent. We describe a polynomial time algorithm to find a maximum weight induced complete multipartite (MWICM) subgraph in a directed path overlap graph. In addition, we describe polynomial time algorithms to find maximum weight induced (restricted) multicliques (MWIM) and multiclique-multipartite (MWIMM) subgraphs in directed path overlap graphs. <\/jats:p>","DOI":"10.1142\/s1793830915500615","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T06:33:07Z","timestamp":1445236387000},"page":"1550061","source":"Crossref","is-referenced-by-count":0,"title":["Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Fanica","family":"Gavril","sequence":"first","affiliation":[{"name":"Computer Science Department Technion, Haifa 32000, Israel"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S1793830915500615BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/060666238"},{"key":"S1793830915500615BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0649-5"},{"key":"S1793830915500615BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.07.004"},{"key":"S1793830915500615BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797322334"},{"key":"S1793830915500615BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"key":"S1793830915500615BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020961"},{"key":"S1793830915500615BIB007","volume-title":"Computers and Intractability: A Guide to the Theory NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830915500615BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030305"},{"key":"S1793830915500615BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00025-9"},{"key":"S1793830915500615BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.006"},{"key":"S1793830915500615BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02029-2_3"},{"key":"S1793830915500615BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.02.005"},{"key":"S1793830915500615BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830914500189"},{"key":"S1793830915500615BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90019-5"},{"key":"S1793830915500615BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00371-8"},{"key":"S1793830915500615BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.bbrc.2009.09.130"},{"key":"S1793830915500615BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90216-I"},{"key":"S1793830915500615BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00344-5"},{"key":"S1793830915500615BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.61"},{"key":"S1793830915500615BIB021","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl338"},{"key":"S1793830915500615BIB022","series-title":"Fields Institute Monographs","volume-title":"Efficient Graph Representations","volume":"19","author":"Spinrad J. P.","year":"2003"},{"key":"S1793830915500615BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0161-Q"},{"key":"S1793830915500615BIB024","doi-asserted-by":"publisher","DOI":"10.1042\/BST0311491"},{"key":"S1793830915500615BIB025","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:34:48Z","timestamp":1565123688000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":24,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S1793830915500615"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500615","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}