On the power of BFS to determine a graph's diameter (Q4446912): Difference between revisions

@@ Property / DOI @@
-.1002/net.10098
@@ Property / DOI: 10.1002/net.10098 / rank @@
-Normal rank
@@ Property / author @@
-Q175509
@@ Property / author: Q175509 / rank @@
-Normal rank
@@ Property / author @@
+Derek Gordon Corneil
@@ Property / author: Derek Gordon Corneil / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.10098
@@ Property / full work available at URL: https://doi.org/10.1002/net.10098 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2082613046
@@ Property / OpenAlex ID: W2082613046 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+On linear and circular structure of (claw, net)-free graphs
+Normal rank
@@ Property / cites work @@
+Diameter determination on restricted graph families
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Almost diameter of a house-hole-free graph in linear time via LexBFS
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / DOI @@
+.1002/NET.10098
@@ Property / DOI: 10.1002/NET.10098 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4446912