Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computational Complexity of Geodetic Set - MaRDI portal

Computational Complexity of Geodetic Set

From MaRDI portal
Publication:4543521

DOI10.1080/00207160210954zbMath0999.05027OpenAlexW2074999464MaRDI QIDQ4543521

Mustafa Atici

Publication date: 2 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160210954




Related Items (26)

Parameterized Complexity of Geodetic SetDiscrete Sturm-Liouville problems with nonlinear parameter in the boundary conditionsWell-partitioned chordal graphsA general framework for path convexitiesSteiner intervals and Steiner geodetic numbers in distance-hereditary graphsOn the toll number of a graphThe 2-edge geodetic number and graph operationsThe forcing total restrained geodetic number and the total restrained geodetic number of a graph: realizability and complexityTotal restrained geodetic number of graphsThree problems on well-partitioned chordal graphsOn the hardness of finding the geodetic number of a subcubic graphOn the geodetic number of complementary prismsGeodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphsOn pitfalls in computing the geodetic number of a graphSome remarks on the geodetic number of a graphThe geodetic number of the lexicographic product of graphsComplexity results related to monophonic convexityStrong geodetic problem in networksStrong geodetic problem on complete multipartite graphsOn The Edge Geodetic Number Of A GraphOn the Convexity of Paths of Length Two in Undirected GraphsGeodetic number of powers of cyclesAlgorithmic upper bounds for graph geodetic numberParameterized Complexity of Geodetic SetGraphs with large total geodetic numberAn \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs




This page was built for publication: Computational Complexity of Geodetic Set