Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
From MaRDI portal
Publication:5302046
DOI10.1007/978-3-540-92248-3_9zbMath1202.05134OpenAlexW1493268504MaRDI QIDQ5302046
Pierluigi Crescenzi, Federico Greco, Gianluca Rossi, Paola Vocca, Miriam Di Ianni
Publication date: 20 January 2009
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_9
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work