Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.
Sudeshna KolayFahad PanolanVenkatesh RamanSaket SaurabhPublished in: MFCS (2016)
Keyphrases
- graph theory
- graph structures
- learning algorithm
- max cut
- theoretical analysis
- computationally efficient
- data structure
- optimization problems
- dynamic graph
- planar graphs
- graph matching
- minimum spanning tree
- neural network
- worst case
- maximum clique
- web pages
- graph search
- real world networks
- graph mining
- bipartite graph
- directed graph
- social network analysis
- search algorithm
- computational complexity