Positional dominance: concepts and algorithms

DOI10.1007/978-3-319-53007-9_6MaRDI QIDQ2971635zbMATH OpenOpenAlexFDO

Authors Ulrik Brandes, Moritz Heine, Julian-Steffen Müller, Mark Ortmann

Publication date 7 April 2017

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://nbn-resolving.de/urn:nbn:de:bsz:352-0-419565

zbMATH Keywords

centrality indicesdomination among vertices

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Network Analysis
• Re-conceptualizing centrality in social networks
• Network Analysis
• A centrality notion for graphs based on Tukey depth
• Centrality measures in networks

Cites work

• A simple sub-quadratic algorithm for computing the subset partial order
• A survey of the algorithmic aspects of modular decomposition
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Arboricity and Subgraph Listing Algorithms
• Decomposition of Finite Graphs Into Forests
• Finding extremal sets in less than quadratic time
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Network Analysis
• On Computing the Subset Graph of a Collection of Sets
• Preserving order in a forest in less than logarithmic time and linear space
• Re-conceptualizing centrality in social networks
• The centrality index of a graph
• The Dilworth Number of a Graph
• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
• Three Partition Refinement Algorithms
• Threshold graphs and related topics

Cited in

(3)

• A centrality notion for graphs based on Tukey depth
• Central Positions in Social Networks
• Network Analysis

This page was built for publication: Positional dominance: concepts and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971635)