Results 91 to 100 of about 70,417 (125)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

Embedded Systems and Applications
In 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, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu   +4 more
semanticscholar   +1 more source

First-Order Logic and Twin-Width for Some Geometric Graphs

arXiv.org
For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC'22], where the equivalence is called ...
Colin Geniet, Gunwoo Kim, Lucas Meijer
semanticscholar   +1 more source

Embedding Higman–Thompson groups of unfolding trees into the Leavitt path algebras

Indagationes mathematicae
The isomorphism problem of regular Higman-Thompson groups was solved in arXiv:1006.1759, via embedding it into the Leavitt algebra. In this paper, we will expand these results to embed the Higman-Thompson groups of unfolding trees of directed graphs into
Roman Gorazd
semanticscholar   +1 more source

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs

ACM-SIAM Symposium on Discrete Algorithms
We consider Directed Steiner Forest (DSF), a fundamental problem in network design. The input to DSF is a directed edge-weighted graph $G = (V, E)$ and a collection of vertex pairs $\{(s_i, t_i)\}_{i \in [k]}$. The goal is to find a minimum cost subgraph
Chandra Chekuri, Rhea Jain
semanticscholar   +1 more source

Lower Bounds for Leaf Rank of Leaf Powers

International Workshop on Combinatorial Algorithms
Leaf powers and $k$-leaf powers have been studied for over 20 years, but there are still several aspects of this graph class that are poorly understood. One such aspect is the leaf rank of leaf powers, i.e.
Svein Høgemo
semanticscholar   +1 more source

Computing the K-terminal reliability of directed path graphs

Information Processing Letters, 2015
Min-Sheng Lin, Chao-Chun Ting
semanticscholar   +1 more source

Counting maximal independent sets in directed path graphs

Information Processing Letters, 2014
Min-Sheng Lin, S. Su
semanticscholar   +1 more source

Microbial diversity in extreme environments

Nature Reviews Microbiology, 2021
Wen-Sheng Shu, Li-Nan Huang
exaly  

Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

Discret. Math. Algorithms Appl., 2015
F. Gavril
semanticscholar   +1 more source

Incremental Low-High Orders of Directed Graphs and Applications

The Sea, 2017
Loukas Georgiadis, K. Giannis, Aikaterini Karanasiou, L. Laura   +3 more
semanticscholar   +1 more source