Carregant...
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...
Guardat en:
| Publicat a: | Int J Comput Sci (Rabat) |
|---|---|
| Autors principals: | , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2016
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4913482/ https://ncbi.nlm.nih.gov/pubmed/27336059 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|