Chapter 9. Role assignments

DOI10.1007/978-3-540-31955-9_9MaRDI QIDQ5703984zbMATH OpenOpenAlexFDO

Authors Jürgen Lerner

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106453

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(11)

• Logical characterizations of regular equivalence in weighted social networks
• A theoretical investigation of regular equivalences for fuzzy graphs
• A logical framework for privacy-preserving social network publication
• Positional dominance: concepts and algorithms
• Group-Level Analysis and Visualization of Social Networks
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Direct and indirect methods for solving two-mode systems of fuzzy relation equations and inequalities
• Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
• How many cliques can a clique cover cover?
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence

This page was built for publication: Chapter 9. Role assignments

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