Computing maximum matchings in temporal graphs. (Q5874299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing maximum matchings in temporal graphs. |
scientific article; zbMATH DE number 7650912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing maximum matchings in temporal graphs. |
scientific article; zbMATH DE number 7650912 |
Statements
7 February 2023
0 references
temporal graph
0 references
link stream
0 references
temporal line graph
0 references
NP-hardness
0 references
APX-hardness
0 references
approximation algorithm
0 references
fixed-parameter tractability
0 references
independent set
0 references
Computing maximum matchings in temporal graphs. (English)
0 references
0.8862959742546082
0 references
0.8459538817405701
0 references
0.8375077843666077
0 references
0.8132151365280151
0 references
0.7904729843139648
0 references
