Can Everybody Sit Closer to Their Friends Than Their Enemies?

DOI10.1007/978-3-642-22993-0_36zbMath1343.68184arXiv1405.5023OpenAlexW2233339885MaRDI QIDQ3088056

Christopher Thraves, Anne-Marie Kermarrec

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5023

zbMATH Keywords

graph drawinggraph embeddingsigned graphsstructural balance

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Embedding signed graphs in the line ⋮ The dimension of valid distance drawings of signed graphs ⋮ The weighted sitting closer to friends than enemies problem in the line ⋮ Sitting closer to friends than enemies, revisited

Cites Work

• Correlation clustering
• A simple algorithm to detect balance in signed graphs
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• On the notion of balance of a signed graph
• Counting balanced signed graphs using marked graphs
• On the number of balanced signed graphs