Computing role assignments of split graphs
From MaRDI portal
Publication:287443
DOI10.1016/j.tcs.2016.05.011zbMath1339.05384OpenAlexW2345501990MaRDI QIDQ287443
Publication date: 26 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.011
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Parameterizing role coloring on forests ⋮ On the number of maximal independent sets in minimum colorings of split graphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Role colouring graphs in hereditary classes ⋮ Role coloring bipartite graphs
Cites Work
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of chordal graphs
- Dominating sets for split and bipartite graphs
- A complete complexity classification of the role assignment problem
- Comparing universal covers in polynomial time
- Clustering and domination in perfect graphs
- The splittance of a graph
- Role colouring a graph
- Some simplified NP-complete graph problems
- 2-role assignments on triangulated graphs.
- Algorithmic graph theory and perfect graphs
- HAMILTONian circuits in chordal bipartite graphs
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- How hard is it to determine if a graph has a 2-role assignment?
- Graph Transformations
- The role assignment model nearly fits most social networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing role assignments of split graphs
