Meeting times on graphs in near-cubic time
Fuente:
arXiv
Saved in:
| Main Author: | McAvoy, Alex |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
by: Bryant, David, et al.
Published: (2026)
by: Bryant, David, et al.
Published: (2026)
Graph-based method for constructing consensus trees
by: Torquet, Elio, et al.
Published: (2025)
by: Torquet, Elio, et al.
Published: (2025)
Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
by: Moreno, Matthew Andres, et al.
Published: (2024)
by: Moreno, Matthew Andres, et al.
Published: (2024)
phylo2vec: a library for vector-based phylogenetic tree manipulation
by: Scheidwasser, Neil, et al.
Published: (2025)
by: Scheidwasser, Neil, et al.
Published: (2025)
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
by: Mestel, David, et al.
Published: (2024)
by: Mestel, David, et al.
Published: (2024)
Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
by: Klawitter, Jonathan, et al.
Published: (2025)
by: Klawitter, Jonathan, et al.
Published: (2025)
Frequency-dependent returns in nonlinear public goods games
by: Hauert, Christoph, et al.
Published: (2024)
by: Hauert, Christoph, et al.
Published: (2024)
A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
by: van Iersel, Leo, et al.
Published: (2026)
by: van Iersel, Leo, et al.
Published: (2026)
Reconstructing semi-directed level-1 networks using few quarnets
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)
by: Draesslerová, Dominika, et al.
Published: (2024)
When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
by: Huber, Katharina T., et al.
Published: (2024)
by: Huber, Katharina T., et al.
Published: (2024)
Snakes and Ladders: a Treewidth Story
by: Chaplick, Steven, et al.
Published: (2023)
by: Chaplick, Steven, et al.
Published: (2023)
Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
by: Skums, P.
Published: (2026)
by: Skums, P.
Published: (2026)
Galled Perfect Transfer Networks
by: Sánchez, Alitzel López, et al.
Published: (2024)
by: Sánchez, Alitzel López, et al.
Published: (2024)
A branch-&-price approach to the unrooted maximum agreement forest problem
by: Frohn, Martin, et al.
Published: (2024)
by: Frohn, Martin, et al.
Published: (2024)
When is local search both effective and efficient?
by: Kaznatcheev, Artem, et al.
Published: (2024)
by: Kaznatcheev, Artem, et al.
Published: (2024)
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
by: Kaznatcheev, Artem, et al.
Published: (2024)
by: Kaznatcheev, Artem, et al.
Published: (2024)
On the existence of funneled orientations for classes of rooted phylogenetic networks
by: Döcker, Janosch, et al.
Published: (2024)
by: Döcker, Janosch, et al.
Published: (2024)
The coalescent in finite populations with arbitrary, fixed structure
by: Allen, Benjamin, et al.
Published: (2022)
by: Allen, Benjamin, et al.
Published: (2022)
Expectation-enforcing strategies for repeated games
by: Dimou, Nikos, et al.
Published: (2025)
by: Dimou, Nikos, et al.
Published: (2025)
Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)
by: Kaznatcheev, Artem
Published: (2024)
Seed Selection in the Heterogeneous Moran Process
by: Petsinis, Petros, et al.
Published: (2024)
by: Petsinis, Petros, et al.
Published: (2024)
Tree Containment Parameterized by Scanwidth
by: van Iersel, Leo, et al.
Published: (2026)
by: van Iersel, Leo, et al.
Published: (2026)
A Vector Representation for Phylogenetic Trees
by: Chauve, Cedric, et al.
Published: (2024)
by: Chauve, Cedric, et al.
Published: (2024)
Fixation times on directed graphs
by: Brewster, David A., et al.
Published: (2023)
by: Brewster, David A., et al.
Published: (2023)
Smallest suffixient set maintenance in near-real-time
by: Köppl, Dominik, et al.
Published: (2026)
by: Köppl, Dominik, et al.
Published: (2026)
Colonization times in Moran process on graphs
by: Kopfová, Lenka, et al.
Published: (2024)
by: Kopfová, Lenka, et al.
Published: (2024)
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
by: Ghanbari, Babak, et al.
Published: (2025)
by: Ghanbari, Babak, et al.
Published: (2025)
Quasilinear-time eccentricities computation, and more, on median graphs
by: Bergé, Pierre, et al.
Published: (2024)
by: Bergé, Pierre, et al.
Published: (2024)
Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
by: Kowalik, Lukasz
Published: (2024)
by: Kowalik, Lukasz
Published: (2024)
Distributed computation of temporal twins in periodic undirected time-varying graphs
by: Azerouk, Lina, et al.
Published: (2024)
by: Azerouk, Lina, et al.
Published: (2024)
Interplay between evolutionary and epidemic time scales challenges the outcome of control policies
by: Lamata-Otín, Santiago, et al.
Published: (2026)
by: Lamata-Otín, Santiago, et al.
Published: (2026)
A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
by: Fox, Emily
Published: (2023)
by: Fox, Emily
Published: (2023)
$k$-times bin packing and its application to fair electricity distribution
by: Baghel, Dinesh Kumar, et al.
Published: (2023)
by: Baghel, Dinesh Kumar, et al.
Published: (2023)
A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)
by: Jenssen, Matthew, et al.
Published: (2024)
Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)
by: Paul, Christophe, et al.
Published: (2025)
Seasonality and susceptibility from measles time series
by: Thakkar, Niket, et al.
Published: (2024)
by: Thakkar, Niket, et al.
Published: (2024)
Recovering complex ecological dynamics from time series using state-space universal dynamic equations
by: Buckner, Jack H., et al.
Published: (2024)
by: Buckner, Jack H., et al.
Published: (2024)
Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)
by: Biedl, Therese
Published: (2025)
Similar Items
-
LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
by: Bryant, David, et al.
Published: (2026) -
Graph-based method for constructing consensus trees
by: Torquet, Elio, et al.
Published: (2025) -
Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
by: Moreno, Matthew Andres, et al.
Published: (2024) -
phylo2vec: a library for vector-based phylogenetic tree manipulation
by: Scheidwasser, Neil, et al.
Published: (2025) -
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
by: Mestel, David, et al.
Published: (2024)