Lanean...
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...
Gorde:
| Argitaratua izan da: | Int J Comput Sci (Rabat) |
|---|---|
| Egile Nagusiak: | , , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
2016
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4913482/ https://ncbi.nlm.nih.gov/pubmed/27336059 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|