{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:03:39Z","timestamp":1760061819833},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_6","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"60-71","source":"Crossref","is-referenced-by-count":4,"title":["Positional Dominance: Concepts and Algorithms"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Heine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Ortmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"205979911663065","DOI":"10.1177\/2059799116630650","volume":"9","author":"U Brandes","year":"2016","unstructured":"Brandes, U.: Network positions. Methodol. Innov. 9, 2059799116630650 (2016)","journal-title":"Methodol. Innov."},{"issue":"1","key":"6_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"543","DOI":"10.7155\/jgaa.00273","volume":"16","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. J. Graph Algorithms Appl. 16(2), 543\u2013567 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-5060(08)70334-0","volume":"2","author":"S Foldes","year":"1978","unstructured":"Foldes, S., Hammer, P.L.: The Dilworth number of a graph. Ann. Discret. Math. 2, 211\u2013219 (1978)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"6_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"1","key":"6_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"6_CR8","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic J. Comput. 14(1\u20132), 87\u2013108 (2007)","journal-title":"Nordic J. Comput."},{"issue":"4","key":"6_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $${\\rm n}^{{5\/2}}$$ n 5 \/ 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"6_CR10","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1007\/s10618-016-0451-4","volume":"30","author":"S Lagraa","year":"2016","unstructured":"Lagraa, S., Seba, H.: An efficient exact algorithm for triangle listing in large graphs. Data Min. Knowl. Disc. 30(5), 1350\u20131369 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-31955-9_9","volume-title":"Network Analysis","author":"J Lerner","year":"2005","unstructured":"Lerner, J.: Role assignments. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 216\u2013252. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-31955-9_9"},{"issue":"1","key":"6_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Soc. 1(1), 49\u201380 (1971)","journal-title":"J. Math. Soc."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc, L., Chen, D., Ren, X.L., Zhang, Q.M., Zhang, Y.C., Zhou, T.: Vital nodes identification in complex networks. Phys. Rep. 650, 1\u201363 (2016)","journal-title":"Phys. Rep."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: A data structure for orthogonal range queries. In: 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16\u201318 October 1978, pp. 28\u201334 (1978)","DOI":"10.1109\/SFCS.1978.1"},{"key":"6_CR15","volume-title":"Threshold Graphs and Related Topics, Annals of Discrete Mathematics","author":"NV Mahadev","year":"1995","unstructured":"Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics, Annals of Discrete Mathematics, vol. 56. Elsevier, Amsterdam (1995)"},{"issue":"1","key":"6_CR16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39(1), 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Ortmann, M., Brandes, U.: Triangle listing algorithms: back from the diversion. In: Proceedings of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX 2014), pp. 1\u20138 (2014)","DOI":"10.1137\/1.9781611973198.1"},{"issue":"6","key":"6_CR18","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jagm.1999.1032","volume":"33","author":"P Pritchard","year":"1999","unstructured":"Pritchard, P.: On computing the subset graph of a collection of sets. J. Algorithms 33(2), 187\u2013203 (1999)","journal-title":"J. Algorithms"},{"issue":"6","key":"6_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0020-0190(95)00165-4","volume":"56","author":"P Pritchard","year":"1995","unstructured":"Pritchard, P.: A simple sub-quadratic algorithm for computing the subset partial order. Inf. Process. Lett. 56(6), 337\u2013341 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"6_CR21","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581\u2013603 (1966)","journal-title":"Psychometrika"},{"issue":"6","key":"6_CR22","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1017\/S0956792516000401","volume":"27","author":"D Schoch","year":"2016","unstructured":"Schoch, D., Brandes, U.: Re-conceptualizing centrality in social networks. Eur. J. Appl. Math. 27(6), 971\u2013985 (2016)","journal-title":"Eur. J. Appl. Math."},{"issue":"1","key":"6_CR23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(93)90264-A","volume":"48","author":"DM Yellin","year":"1993","unstructured":"Yellin, D.M., Jutla, C.S.: Finding extremal sets in less than quadratic time. Inf. Process. Lett. 48(1), 29\u201334 (1993)","journal-title":"Inf. Process. Lett."}],"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-53007-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:19Z","timestamp":1498368919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}