A faster parameterized algorithm for temporal matching

A temporal graph is a sequence of graphs (called layers) over the same vertex set—describing a graph topology which is subject to discrete changes over time. A Δ-temporal matching M is a set of time edges (e,t) (an edge e paired up with a point in time t) such that for all distinct time edges (e,t),...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 174; p. 106181
Main Author:	Zschoche, Philipp
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2022
Subjects:	Graph algorithms Parameterized algorithms Temporal graphs Δ-windows Temporal graphs Parameterized algorithms Δ-windows Graph algorithms
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!