"An O∗(1.4366n)-time exact algorithm for ..."

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung (2016)

> Home

Details and statistics

DOI: 10.1007/S10878-015-9884-8

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ChangCH16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ChangCH16
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An O^∗(1.4366ⁿ)-time exact algorithm for maximum P₂-packing in cubic graphs. J. Comb. Optim. 32(2): 594-607 (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.