Results 71 to 80 of about 4,527 (99)
Some of the next articles are maybe not open access.
Towards Transitive-free Digraphs
Theoretical Computer ScienceIn a digraph $D$, an arc $e=(x,y) $ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D- e$. A digraph is transitive-free if it does not contain any transitive arc. In the Transitive-free Vertex Deletion (TVD) problem, the goal is to
Ankit Abhinav +2 more
semanticscholar +1 more source
New Algorithms and Lower Bounds for Streaming Tournaments
Embedded Systems and ApplicationsWe study fundamental directed graph (digraph) problems in the streaming model. An initial investigation by Chakrabarti, Ghosh, McGregor, and Vorotnikova [SODA'20] on streaming digraphs showed that while most of these problems are provably hard in general,
Prantar Ghosh, Sahil Kuchlous
semanticscholar +1 more source
Restricted CSPs and F-free Digraph Algorithmics
International Colloquium on Automata, Languages and ProgrammingIn recent years, much attention has been placed on the complexity of graph homomorphism problems when the input is restricted to ${\mathbb P}_k$-free and ${\mathbb P}_k$-subgraph-free graphs.
Santiago Guzm'an-Pro, Barnaby Martin
semanticscholar +1 more source
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
Embedded Systems and ApplicationsIn the Directed Steiner Tree (DST) problem the input is a directed edge-weighted graph $G=(V,E)$, a root vertex $r$ and a set $S \subseteq V$ of $k$ terminals. The goal is to find a min-cost subgraph that connects $r$ to each of the terminals. DST admits
Chandra Chekuri +4 more
semanticscholar +1 more source
Tournaments and Semicomplete Digraphs
Classes of Directed Graphs, 2018J. Bang-Jensen, F. Havet
semanticscholar +1 more source
Locally semicomplete digraphs: A generalization of tournaments
Journal of Graph Theory, 1990J. Bang-Jensen
semanticscholar +1 more source
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Nature Methods, 2021Haoyu Cheng +2 more
exaly