Login / Signup
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver.
Parinya Chalermsook
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
Pattara Sukprasert
Sorrachai Yingchareonthawornchai
Published in:
ICALP (2022)
Keyphrases
</>
linear programming
edge detection
linear program
graph mining
edge information
worst case
weighted graph
edge map
frequent subgraph mining
multiscale
objective function
support vector
lower bound
connected components
subgraph mining