Positional Dominance: Concepts and Algorithms
From MaRDI portal
Publication:2971635
DOI10.1007/978-3-319-53007-9_6zbMath1487.05192MaRDI QIDQ2971635
Mark Ortmann, Moritz Heine, Julian Müller, Ulrik Brandes
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
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- Unnamed Item
- A survey of the algorithmic aspects of modular decomposition
- A simple sub-quadratic algorithm for computing the subset partial order
- Preserving order in a forest in less than logarithmic time and linear space
- Finding extremal sets in less than quadratic time
- Threshold graphs and related topics
- The centrality index of a graph
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- Arboricity and Subgraph Listing Algorithms
- Three Partition Refinement Algorithms
- The Dilworth Number of a Graph
- Re-conceptualizing centrality in social networks
- On Computing the Subset Graph of a Collection of Sets
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Network Analysis
- Decomposition of Finite Graphs Into Forests