Zobrazeno 1 - 10
of 8 412
pro vyhledávání: '"Linear time algorithms"'
Autor:
Korhonen, Tuukka
We present $k^{O(k^2)} m$ time algorithms for various problems about decomposing a given undirected graph by edge cuts or vertex separators of size $
Externí odkaz:
http://arxiv.org/abs/2411.02658
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Meierhans, Simon, Gutenberg, Maximilian Probst, Sachdeva, Sushant
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost incre
Externí odkaz:
http://arxiv.org/abs/2407.10830
Autor:
Hellmuth, Marc, Scholz, Guillaume E.
The class of $\mathsf{Ga}$lled-$\mathsf{T}$ree $\mathsf{Ex}$plainable ($\mathsf{GaTEx}$) graphs has recently been discovered as a natural generalization of cographs. Cographs are precisely those graphs that can be uniquely represented by a rooted tre
Externí odkaz:
http://arxiv.org/abs/2306.04367
Causal effect estimation from observational data is a fundamental task in empirical sciences. It becomes particularly challenging when unobserved confounders are involved in a system. This paper focuses on front-door adjustment -- a classic technique
Externí odkaz:
http://arxiv.org/abs/2211.16468
Many ncRNAs function through RNA-RNA interactions. Fast and reliable RNA structure prediction with consideration of RNA-RNA interaction is useful. Some existing tools are less accurate due to omitting the competing of intermolecular and intramolecula
Externí odkaz:
http://arxiv.org/abs/2210.14982
Publikováno v:
In Computational Geometry: Theory and Applications October 2023 114
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Vertex connectivity is a well-studied concept in graph theory with numerous applications. A graph is $k$-connected if it remains connected after removing any $k-1$ vertices. The vertex connectivity of a graph is the maximum $k$ such that the graph is
Externí odkaz:
http://arxiv.org/abs/2103.15703
Autor:
Bonomo-Braberman, Flavia, Nascimento, Julliano R., Oliveira, Fabiano S., Souza, Uéverton S., Szwarcfiter, Jayme L.
Publikováno v:
International Transactions in Operational Research 31 (2024), 296--315
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given graph to a claw-free graph, considering vertex elimination as measure. CLA
Externí odkaz:
http://arxiv.org/abs/2004.05672
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.