Computing Giant Graph Diameters (Q2819520)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computing Giant Graph Diameters	scientific article

Statements

scholarly article

0 references

Computing Giant Graph Diameters (English)

0 references

Peter Damaschke

0 references

Lecture Notes in Computer Science

0 references

publication date

29 September 2016

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-44543-4_29

0 references

Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

0 references

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs

0 references

Fast and Simple Approximation of the Diameter and Radius of a Graph

0 references

Diameter determination on restricted graph families

0 references

On the power of BFS to determine a graph's diameter

0 references

Algorithms – ESA 2005

0 references

Almost diameter of a house-hole-free graph in linear time via LexBFS

0 references

Sequential Minimax Search for a Maximum

0 references

Fast approximation algorithms for the diameter and radius of sparse graphs

0 references

A simple test on 2-vertex- and 2-edge-connectivity

0 references

Approximating the Diameter of Planar Graphs in Near Linear Time

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-44543-4_29

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2819520

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2819520&oldid=36275784"