"On the complexity of edge-colored subgraph partitioning problems in ..."

Xiaoyan Zhang et al. (2016)

> Home

Details and statistics

DOI: 10.46298/DMTCS.2159

access: open

type: Journal Article

metadata version: 2023-01-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmtcs/ZhangZBW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/ZhangZBW16
Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen:
On the complexity of edge-colored subgraph partitioning problems in network optimization. Discret. Math. Theor. Comput. Sci. 17(3): 227-244 (2016)

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.