Join-reachability problems in directed graphs (Q2254502): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q3007627 |
||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Join-Reachability Problems in Directed Graphs | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 5908680 | |||||||||||||||
Property / title | |||||||||||||||
Join-Reachability Problems in Directed Graphs (English) | |||||||||||||||
Property / title: Join-Reachability Problems in Directed Graphs (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1332.68172 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-642-20712-9_15 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Computer Science – Theory and Applications / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
17 June 2011
| |||||||||||||||
Property / publication date: 17 June 2011 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 5908680 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W1890074740 / rank | |||||||||||||||
Normal rank |
Revision as of 09:51, 6 May 2024
scientific article; zbMATH DE number 5908680
- Join-Reachability Problems in Directed Graphs
Language | Label | Description | Also known as |
---|---|---|---|
English | Join-reachability problems in directed graphs |
scientific article; zbMATH DE number 5908680 |
|
Statements
Join-reachability problems in directed graphs (English)
0 references
Join-Reachability Problems in Directed Graphs (English)
0 references
5 February 2015
0 references
17 June 2011
0 references
algorithms
0 references
data structures
0 references
graph algorithms
0 references
reachability
0 references
combinatorial complexity
0 references