LBFS orderings and cocomparability graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the Power of BFS to Determine a Graphs Diameter
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |