"Hardness Results and Efficient Algorithms for Graph Powers."

Van Bang Le, Nguyen Ngoc Tuy (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-11409-0_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/LeT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/LeT09
Van Bang Le, Nguyen Ngoc Tuy:
Hardness Results and Efficient Algorithms for Graph Powers. WG 2009: 238-249

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.