Caricamento...
Linear Time Vertex Partitioning on Massive Graphs
The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds of nodes and less optimal but faster techni...
Salvato in:
| Pubblicato in: | Int J Comput Sci (Rabat) |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2016
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4913482/ https://ncbi.nlm.nih.gov/pubmed/27336059 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|