Algorithms and complexity for geodetic sets on planar and chordal graphs.
Dibyayan ChakrabortySandip DasFlorent FoucaudHarmender GahlawatDimitri LajouBodhayan RoyPublished in: CoRR (2020)
Keyphrases
- computational complexity
- space complexity
- computational cost
- worst case
- computationally efficient
- orders of magnitude
- learning algorithm
- graph theory
- high computational complexity
- machine learning algorithms
- memory requirements
- evolutionary algorithm
- optimization problems
- theoretical analysis
- bipartite graph
- undirected graph