Ranking of Graphs

Authors:
Hans L. Bodlaender;Jitender S. Deogon;Klaus Jansen;Ton Kloks;Dieter Kratsch;Haiko Müller;Zsolt Tuza
Affiliations:
-;-;-;-;-;-;-
Venue:
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1994

Finding optimal edge-rankings of trees

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Ranking numbers of graphs

Information Processing Letters
When trees grow low: shrubs and fast MSO1

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Hi-index	0.00