Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • AccederRegistro (usuarios no UPC)Acceder (usuarios no UPC)
  • mailContacto
  • world Castellano 
    • Català
    • Castellano
    • English
  • userInicia sesión   
      AccederRegistro (usuarios no UPC)Acceder (usuarios no UPC)

UPCommons. Portal de acceso abierto al conocimiento de la UPC

Banner header
9.397 Ponencias/textos en actas de congresos
You are here:
Ver ítem 
  •   UPCommons
  • Congressos
  • HPGM: High Performance Graph Mining
  • 1st High Performance Graph Mining workshop, Sydney, 10 August 2015
  • Ver ítem
  •   UPCommons
  • Congressos
  • HPGM: High Performance Graph Mining
  • 1st High Performance Graph Mining workshop, Sydney, 10 August 2015
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fast, exact graph diameter computation with vertex programming

Thumbnail
Ver/Abrir
hpgm_15_2.pdf (522,0Kb)
Comparte:
 
 
10.5821/hpgm15.2
 
  Ver Estadísticas de uso
Cita com:
hdl:2117/76371

Mostrar el registro completo del ítem
Pennycuff, Corey
Weninger, Tim
Tipo de documentoTexto en actas de congreso
Fecha de publicación2015
EditorBarcelona Supercomputing Center
Condiciones de accesoAcceso abierto
Attribution-ShareAlike 3.0 Spain
Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons : Reconocimiento-CompartirIgual 3.0 España
Resumen
In graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, insomuch that approximation algorithms are commonly used instead of exact measurements. In this paper, we present a new algorithm to measure the exact diameter of unweighted graphs using vertex programming, which is easily distributed. We also show the practical performance of the algorithm in comparison to other, widely available algorithms and implementations, as well as the unreliability in accuracy of some pseudo-diameter estimators.
CitaciónPennycuff, Corey; Weninger, Tim. Fast, Exact Graph Diameter Computation with Vertex Programming. A: High Performance Graph Mining. "1st High Performance Graph Mining workshop, Sydney, 10 August 2015", 2015. 
URIhttp://hdl.handle.net/2117/76371
DOI10.5821/hpgm15.2
Colecciones
  • HPGM: High Performance Graph Mining - 1st High Performance Graph Mining workshop, Sydney, 10 August 2015 [3]
Comparte:
 
  Ver Estadísticas de uso

Mostrar el registro completo del ítem

FicherosDescripciónTamañoFormatoVer
hpgm_15_2.pdf522,0KbPDFVer/Abrir

Listar

Esta colecciónPor fechaAutoresOtras contribucionesTítulosMateriasEste repositorioComunidades & coleccionesPor fechaAutoresOtras contribucionesTítulosMaterias

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • Sobre esta web
  • Contacto
  • Sugerencias
  • Configuración de privacidad
  • Inici de la pàgina