Image de couverture de livre

Largest common subgraph of two forests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rautenbach, Dieter, Werner, Florian
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
par: Galby, Esther, et autres
Publié: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
par: Arkhipov, Pavel, et autres
Publié: (2024)

On the number of $k$-mers admitting a given lexicographical minimizer
par: Ingels, Florian, et autres
Publié: (2024)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

$α_i$-Metric Graphs: Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Deterministic approximation for the volume of the truncated fractional matching polytope
par: Guo, Heng, et autres
Publié: (2024)

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

A logarithmic approximation of linearly ordered colourings
par: Håstad, Johan, et autres
Publié: (2024)

On the sizes of BDDs and ZDDs representing matroids
par: Emoto, Hiromi, et autres
Publié: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
par: d'Orsi, Tommaso, et autres
Publié: (2024)

On the enumeration of signatures of XOR-CNF's
par: Creignou, Nadia, et autres
Publié: (2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

Palette Sparsification for Graphs with Sparse Neighborhoods
par: Dhawan, Abhishek
Publié: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
par: Chen, Yu, et autres
Publié: (2024)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
par: Lau, Lap Chi, et autres
Publié: (2024)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)

Half-space separation in monophonic convexity
par: Elaroussi, Mohammed, et autres
Publié: (2024)

Holey graphs: very large Betti numbers are testable
par: Szabó, Dániel, et autres
Publié: (2024)

Bow Metrics and Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
par: Chakraborty, Dibyayan, et autres
Publié: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

On multidimensional generalization of binary search
par: Dereniowski, Dariusz, et autres
Publié: (2024)

A Uniformly Random Solution to Algorithmic Redistricting
par: Cai, Jin-Yi, et autres
Publié: (2024)

Tree Independence Number IV. Even-hole-free Graphs
par: Chudnovsky, Maria, et autres
Publié: (2024)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
par: Iwata, Satoru, et autres
Publié: (2024)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
par: Chakrabarty, Deeparnab, et autres
Publié: (2024)

Greedy Gray Codes for some Restricted Classes of Binary Words
par: Hassler, Nathanaël, et autres
Publié: (2024)