"A Faster Branching Algorithm for the Maximum k-Defective Clique Problem."

Chunyu Luo et al. (2024)

> Home

Details and statistics

DOI: 10.3233/FAIA240984

access: open

type: Conference or Workshop Paper

metadata version: 2025-01-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ecai/LuoZW024
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecai/LuoZW024
Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao:
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. ECAI 2024: 4132-4139

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.