Arboricity, h-index, and dynamic algorithms

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Arboricity
Cop-win graphs
Data structures
Diamond-free graphs
Dynamic algorithms
h-index
Strongly chordal graphs
H indices
Strongly chordal graph
Algorithms
Diamonds
Graphic methods
Indexing (of information)
Problem solving
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v426-427_n_p75_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares