Login / Signup

The Erdős-Pósa property for clique minors in highly connected graphs.

Reinhard DiestelKen-ichi KawarabayashiPaul Wollan
Published in: J. Comb. Theory, Ser. B (2012)
Keyphrases
  • highly connected
  • simulated annealing
  • graph properties
  • stock market
  • optimal solution
  • data mining
  • structural properties
  • financial time series
  • ppi networks
  • independent set