{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:02:19Z","timestamp":1771704139354,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,19]],"date-time":"2014-02-19T00:00:00Z","timestamp":1392768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10115-014-0736-0","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T21:24:22Z","timestamp":1392672262000},"page":"249-280","source":"Crossref","is-referenced-by-count":5,"title":["Finding top- $$k\\, r$$ k r -cliques for keyword search from graphs in polynomial delay"],"prefix":"10.1007","volume":"43","author":[{"given":"Mehdi","family":"Kargar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aijun","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,19]]},"reference":[{"key":"736_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Becchetti L, Castillo C, Gionis A, Leonardi S (2012) Online team formation in social networks. In: Proceedings of the WWW\u201912, pp 839\u2013848","DOI":"10.1145\/2187836.2187950"},{"issue":"3","key":"736_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M","volume":"36","author":"EM Arkin","year":"2000","unstructured":"Arkin EM, Hassin R (2000) Minimum-diameter covering problems. Networks 36(3):147\u2013155","journal-title":"Networks"},{"key":"736_CR3","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison Wesley, Reading, MA"},{"key":"736_CR4","doi-asserted-by":"crossref","unstructured":"Bhalotia G, Nakhe C, Hulgeri A, Chakrabarti S, Sudarshan S (2002) Keyword searching and browsing in databases using banks. In: Proceedings of ICDE\u201902, pp 431\u2013440","DOI":"10.1109\/ICDE.2002.994756"},{"key":"736_CR5","doi-asserted-by":"crossref","unstructured":"Dalvi B, Kshirsagar M, Sudarshan S (2008) Keyword search on external memory data graphs. In: Proceedings of VLDB\u201908, pp 1189\u20131204","DOI":"10.14778\/1453856.1453982"},{"key":"736_CR6","unstructured":"Datta S, Majumder A, Naidu K (2012) Capacitated team formation problem on social networks. In: Proceedings of KDD\u201912, pp 1005\u20131013"},{"key":"736_CR7","doi-asserted-by":"crossref","unstructured":"Ding B, Yu J, Wang S, Qin L, Zhang X, Lin X (2007) Finding top-k min-cost connected trees in databases. In: Proceedings of ICDE\u201907, pp 836\u2013845","DOI":"10.1109\/ICDE.2007.367929"},{"key":"736_CR8","doi-asserted-by":"crossref","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y, Wu Y (2010) Graph pattern matching: from intractable to polynomial time. In: Proceedings of VLDB\u201910, pp 264\u2013275","DOI":"10.14778\/1920841.1920878"},{"key":"736_CR9","doi-asserted-by":"crossref","unstructured":"Golenberg K, Kimelfeld B, Sagiv Y (2008) Keyword proximity search in complex data graphs. In: Proceedings of SIGMOD\u201908, pp 927\u2013940","DOI":"10.1145\/1376616.1376708"},{"key":"736_CR10","doi-asserted-by":"crossref","unstructured":"He H, Wang H, Yang J, Yu P (2007) Blinks: ranked keyword searches on graphs. In: Proceedings of SIGMOD\u201907, pp 305\u2013316","DOI":"10.1145\/1247480.1247516"},{"key":"736_CR11","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H (2005) Bidirectional expansion for keyword search on graph databases. In: Proceedings of VLDB\u201905, pp 505\u2013516"},{"key":"736_CR12","doi-asserted-by":"crossref","unstructured":"Kargar M, An A (2011) Keyword search in graphs: Finding $$r$$ r -cliques. In: Proceedings of VLDB\u201911, pp 681\u2013692","DOI":"10.14778\/2021017.2021025"},{"key":"736_CR13","doi-asserted-by":"crossref","unstructured":"Kargar M, An A (2012) Efficient top-k keyword search in graphs with polynomial delay. In: Proceedings of ICDE\u201912, pp 1269\u20131272","DOI":"10.1109\/ICDE.2012.124"},{"key":"736_CR14","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, NY, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"736_CR15","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning: supercomputing\u201995. In: Proceedings of the 1995 ACM\/IEEE conference on supercomputing","DOI":"10.1145\/224170.224229"},{"key":"736_CR16","doi-asserted-by":"crossref","unstructured":"Koren Y, North SC, Volinsky C (2006) Measuring and extracting proximity in networks. In: Proceedings of KDD\u201906, pp 245\u2013255","DOI":"10.1145\/1150402.1150432"},{"issue":"2","key":"736_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Inform 15(2):141\u2013145","journal-title":"Acta Inform"},{"key":"736_CR18","doi-asserted-by":"crossref","unstructured":"Lappas T, Liu K, Terzi E (2009) Finding a team of experts in social networks. In: Proceedings of KDD\u201909, pp 467\u2013475","DOI":"10.1145\/1557019.1557074"},{"issue":"7","key":"736_CR19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E Lawler","year":"1972","unstructured":"Lawler E (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag Sci 18(7):401\u2013405","journal-title":"Manag Sci"},{"key":"736_CR20","doi-asserted-by":"crossref","unstructured":"Li G, Ooi BC, Feng J, Wang J, Zhou L (2008) Ease: Efficient and adaptive keyword search on unstructured, semi-structured and structured data. In: Proceedings of SIGMOD\u201908, pp 903\u2013914","DOI":"10.1145\/1376616.1376706"},{"key":"736_CR21","unstructured":"Nielsen J (2012) How many test users in a usability study? http:\/\/www.nngroup.com\/articles\/how-many-test-users\/"},{"key":"736_CR22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10115-010-0284-1","volume":"26","author":"J Park","year":"2011","unstructured":"Park J, Lee S (2011) Keyword search in relational databases. Knowl Inf Syst 26:175\u2013193","journal-title":"Knowl Inf Syst"},{"key":"736_CR23","doi-asserted-by":"crossref","unstructured":"Qin L, Yu J, Chang L, Tao Y (2009) Querying communities in relational databases. In: Proceedings of ICDE\u201909, pp 724\u2013735","DOI":"10.1109\/ICDE.2009.67"},{"key":"736_CR24","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani V (2001) Approximation algorithms. Springer, Berlin"},{"key":"736_CR25","doi-asserted-by":"crossref","unstructured":"Yu J, Qin L, Chang L (eds) (2010) Keyword search in databases. Morgan and Claypool Publisher, NY","DOI":"10.1145\/1559845.1559917"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0736-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0736-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0736-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:24:25Z","timestamp":1565187865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0736-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,19]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["736"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0736-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,19]]}}}