"Approximating the Maximally Balanced Connected Partition Problem in Graphs."

Janka Chlebíková (1996)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2006-01-17

- no documents available
- export record
  dblp key:
  - journals/ipl/Chlebikova96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Chlebikova96
Janka Chlebíková:
Approximating the Maximally Balanced Connected Partition Problem in Graphs. Inf. Process. Lett. 60(5): 223-230 (1996)

a service of

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.