Discrete Mathematics & Theoretical Computer Science (Jan 2007)

On the complexity of the balanced vertex ordering problem

Jan Kára,
Jan Kratochvil,
David R. Wood

Affiliations

Jan Kára: Department of Applied Mathematics [Prague]
Jan Kratochvil: ORCiD; Department of Applied Mathematics [Prague]
David R. Wood: ORCiD; Departament de Matemàtica Aplicada II

DOI: https://doi.org/10.46298/dmtcs.383
Journal volume & issue: Vol. Vol. 9 no. 1, no. Graph and Algorithms

Abstract

Graphs and Algorithms

[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal