Join-reachability problems in directed graphs (Q2254502): Difference between revisions

From MaRDI portal
Merged Item from Q3007627
ReferenceBot (talk | contribs)
Changed an Item
 
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

Latest revision as of 04:50, 4 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
  • Join-Reachability Problems in Directed Graphs

Statements

Join-reachability problems in directed graphs (English)
0 references
Join-Reachability Problems in Directed Graphs (English)
0 references
0 references
0 references
0 references
0 references
5 February 2015
0 references
17 June 2011
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
algorithms
0 references
data structures
0 references
graph algorithms
0 references
reachability
0 references
combinatorial complexity
0 references
0 references
0 references
0 references