The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an earlier one. Its spanning ratio is known to be bounded by a universal constant, but the standard bound obtained from the diamond and good-polyg...
Prosenjit Bose, J. De Carufel, Anil Maheshwari et al.· 0 citations
We study automorphism groups in five extremal families of polyhedral graphs. For every $n\ge14$, we prove that every minimum-order $3$-polytopal graph containing a vertex of each degree $3,4,\ldots,n$ is asymmetric. The proof uses an exact planar defect decomposition, a complete description of the high-degree tail, and...
It is proved that shortest path tree graphs are hamiltonian, and an optimal linear-time algorithm for reconfiguration in shortest path tree graphs is provided, providing an optimal linear-time algorithm for reconfiguration in shortest path tree graphs.
Prosenjit Bose, Amirali Madani, Anil Maheshwari et al.· Journal of Graph Algorithms...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
