The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs.

Naonori Kakimura Ken-ichi Kawarabayashi

Published in: J. Comb. Theory, Ser. B (2018)

Keyphrases

edge disjoint
spanning tree
connected graphs
total length
simulated annealing
undirected graph
edge detection
stock market
neural network
edge information
weighted graph
desirable properties
genetic algorithm ga
edge weights
real time
closed form
scheduling problem
optimal solution
edge direction
genetic algorithm