External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs

Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. In Yingshu Li, Mihaela Cardei, Yan Huang, editors, Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings. Volume 11949 of Lecture Notes in Computer Science, pages 449-460, Springer, 2019. [doi]

Authors

Benoît Darties

This author has not been identified. Look up 'Benoît Darties' in Google

Rodolphe Giroudeau

This author has not been identified. Look up 'Rodolphe Giroudeau' in Google

Jean-Claude König

This author has not been identified. Look up 'Jean-Claude König' in Google

Valentin Pollet

This author has not been identified. Look up 'Valentin Pollet' in Google
runs on