Linear-time graph distance and diameter approximation
Year of publication: |
September 2016
|
---|---|
Authors: | Machado, Raphael C. S. ; Figueiredo, Celina M. H. de |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 5, p. 843-851
|
Subject: | graph diameter | distance in graphs | breadth first search | linear-time algorithm | Graphentheorie | Graph theory | Algorithmus | Algorithm | Deskriptive Statistik | Descriptive statistics |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Konferenzbeitrag ; Conference paper ; Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Other identifiers: | 10.1111/itor.12236 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A linear-time algorithm for clique-coloring planar graphs
Liang, Zuosong, (2019)
-
The determination of a graph center
Ioan, Cătălin Angelo, (2018)
-
Online Collaborative-Filtering on Graphs
Banerjee, Siddhartha, (2014)
- More ...
-
On star and biclique edge-colorings
Dantas, Simone, (2017)
-
The chain graph sandwich problem
Dantas, Simone, (2011)
-
IFORS' Operational Research Hall of Fame : Clóvis Caesar Gonzaga
Figueiredo, Celina M. H. de, (2024)
- More ...