Computing vertex-disjoint paths in large graphs using MAOs

Category

Conference:

International Symposium on Algorithms and Computation (ISAAC) ; 29 (Jiaoxi) : 2018.12.16-19

Published in:

29th International Symposium on Algorithms and Computation : ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan
(12.2018), art. 18

Date Created:

31.03.2020

Date Issued:

12.2018

URN:

urn:nbn:de:0030-drops-99613

DOI:

10.4230/LIPIcs.ISAAC.2018.13

PPN:

104205150X

Language:

English

Type of Resource:

Text

Extent:

12 Seiten

Keywords:

Computing Disjoint Paths; Large Graphs; Vertex-Connectivity; Linear- Time; Maximal Adjacency Ordering; Maximum Cardinality Search; Big Data, Certifying Algorithm

DDC subject of DNB:

510 Mathematics

Hosting institution:

Technische Universität Ilmenau, Fakultät für Mathematik und Naturwissenschaften