"Complexity and kernels for bipartition into degree-bounded induced graphs."

Mingyu Xiao, Hiroshi Nagamochi (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2016.11.011

access: closed

type: Journal Article

metadata version: 2024-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/XiaoN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/XiaoN17
Mingyu Xiao, Hiroshi Nagamochi:
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659: 72-82 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.