Join-reachability problems in directed graphs (Q2254502): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(6 intermediate revisions by 5 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Join-Reachability Problems in Directed Graphs | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | 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 / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2019061455 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W1890074740 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1012.4938 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The Transitive Reduction of a Directed Graph / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Computing Frequency Dominators and Related Problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Join-reachability problems in directed graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q2921698 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the vector representation of the reachability in planar directed graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An Efficient Data Structure for Lattice Operations / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Dynamic reachability in planar digraphs with one source and one sink / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Filtering Search: A New Approach to Query-Answering / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A Separator Theorem for Planar Graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4232786 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||||||||||||||
Normal rank |
Latest revision as of 16:32, 9 July 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
0 references
0 references