Exact methods for the longest induced cycle problem
The longest induced (or chordless) cycle problem is a graph problem classified as NP-complete and involves the task of determining the largest possible subset of vertices within a graph in such a way that the induced subgraph forms a cycle. Within this paper, we present three integer linear programs...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Croatian Operational Research Society
2024-01-01
|
| Saila: | Croatian Operational Research Review |
| Gaiak: | |
| Sarrera elektronikoa: | https://hrcak.srce.hr/file/464230 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|