"The Weighted Integrity Problem is Polynomial for Interval Graphs."

Sibabrata Ray et al. (2006)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2008-11-26

- no documents available
- export record
  dblp key:
  - journals/arscom/RayKZJ06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/RayKZJ06
Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hong Jiang:
The Weighted Integrity Problem is Polynomial for Interval Graphs. Ars Comb. 79 (2006)

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.