Arboricity, h-index, and dynamic algorithms
We propose a new data structure for manipulating graphs, called h-graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each vertex of the graph. The overall size of all triples is O(n+m), for a graph w...
Guardado en:
| Autores principales: | Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L. |
|---|---|
| Formato: | Artículo publishedVersion |
| Publicado: |
2012
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03043975_v426-427_n_p75_Lin https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v426-427_n_p75_Lin_oai |
| Aporte de: |
Ejemplares similares
-
Arboricity, h-index, and dynamic algorithms
por: Lin, M.C., et al.
Publicado: (2012) -
Arboricity, h-index, and dynamic algorithms
por: Lin, M.C., et al. -
Arboricity, h-index, and dynamic algorithms
por: Lin, Min Chih, et al.
Publicado: (2012) -
On probe 2-clique graphs and probe diamond-free graphs
por: Bonomo, F., et al. -
On probe 2-clique graphs and probe diamond-free graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)