Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.
Dibyayan ChakrabortySandip DasFlorent FoucaudHarmender GahlawatDimitri LajouBodhayan RoyPublished in: ISAAC (2020)
Keyphrases
- computational complexity
- computational cost
- graph theory
- worst case
- theoretical analysis
- computationally efficient
- orders of magnitude
- complexity analysis
- space complexity
- high computational complexity
- memory requirements
- lower complexity
- data structure
- learning algorithm
- planar graphs
- maximum clique
- graph isomorphism
- minimum spanning tree
- polynomial time complexity
- graph databases
- graph structure
- lower bound
- optimal solution
- bayesian networks
- image segmentation
- social networks