Breaking symmetry in complete graphs by orienting edges: asymptotic bounds

DOI10.1016/S0020-0190(98)00124-0zbMath1339.05198OpenAlexW1979307071MaRDI QIDQ293364

Frank Harary, Desh Ranjan

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001240?np=y

zbMATH Keywords

computational complexitygraph algorithmsasymptotic boundidentity orientation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Invariance, quasi-invariance, and unimodularity for random graphs

Cites Work

• Parallel concepts in graph theory
• Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
• Unnamed Item

This page was built for publication: Breaking symmetry in complete graphs by orienting edges: asymptotic bounds