Hardness and approximation for L-EPG and B1-EPG graphs.

Dror Epstein Martin Charles Golumbic Abhiruk Lahiri Gila Morgenstern

Published in: Discret. Appl. Math. (2020)

Keyphrases

queueing networks
np complete
learning theory
graph matching
approximation methods
feature selection
image segmentation
spanning tree
graph model
upper bound
closed form
graph mining
approximation algorithms
directed graph
database
np hard
computational complexity
optimal solution
data sets