Imagen de Portada

Induced Subforests and Superforests

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Rautenbach, Dieter, Werner, Florian
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Largest common subgraph of two forests
por: Rautenbach, Dieter, et al.
Publicado: (2024)

Cutwidth and Crossings
por: Rauch, Johannes, et al.
Publicado: (2025)

Making an oriented graph acyclic using inversions of bounded or prescribed size
por: Bang-Jensen, Jørgen, et al.
Publicado: (2025)

Odd and Even Harder Problems on Cycle-Factors
por: Hörsch, Florian, et al.
Publicado: (2025)

Induced Cycles of Many Lengths
por: Chudnovsky, Maria, et al.
Publicado: (2026)

Induced Minors and Coarse Tree Decompositions
por: Chudnovsky, Maria, et al.
Publicado: (2026)

On the number of $k$-mers admitting a given lexicographical minimizer
por: Ingels, Florian, et al.
Publicado: (2024)

On Detecting $H$-Induced Minors for Small $H$
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
por: Scheinerman, Danny
Publicado: (2024)

Counting Permutation Patterns with Multidimensional Trees
por: Beniamini, Gal, et al.
Publicado: (2024)

Lightweight Near-Additive Spanners
por: Gitlitz, Yuval, et al.
Publicado: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
por: Michel, Lukas, et al.
Publicado: (2024)

Matroid Intersection under Minimum Rank Oracle
por: Bárász, Mihály, et al.
Publicado: (2024)

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
por: Nozaki, Yuta, et al.
Publicado: (2024)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
por: Glover, Charles N.
Publicado: (2024)

Minor Containment and Disjoint Paths in almost-linear time
por: Korhonen, Tuukka, et al.
Publicado: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)

Sampling List Packings
por: Camrud, Evan, et al.
Publicado: (2024)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
por: Hu, Jialu, et al.
Publicado: (2024)

Random Generation of Git Graphs
por: Courtiel, Julien, et al.
Publicado: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Compression with wildcards: All induced metric subgraphs
por: Wild, Marcel
Publicado: (2024)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
por: Dhawan, Abhishek
Publicado: (2024)

On the occupancy fraction of the antiferromagnetic Ising model
por: Davies, Ewan, et al.
Publicado: (2024)

Optimal Bounds for Distinct Quartics
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2024)

Distance Reconstruction of Sparse Random Graphs
por: Bastide, Paul
Publicado: (2024)

Sampling and counting triangle-free graphs near the critical density
por: Jenssen, Matthew, et al.
Publicado: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
por: Korhonen, Tuukka
Publicado: (2024)

Spectral Sparsification by Deterministic Discrepancy Walk
por: Lau, Lap Chi, et al.
Publicado: (2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
por: Norose, Ryoma, et al.
Publicado: (2024)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
por: Biedl, Therese, et al.
Publicado: (2024)

Rollercoasters with Plateaus
por: Adamson, Duncan, et al.
Publicado: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
por: Hegde, Anand Shripad, et al.
Publicado: (2024)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
por: Jenssen, Matthew, et al.
Publicado: (2024)

Reconfiguration Using Generalized Token Jumping
por: Křišťan, Jan Matyáš, et al.
Publicado: (2024)

Switching Classes: Characterization and Computation
por: Antony, Dhanyamol, et al.
Publicado: (2024)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
por: Dumitrescu, Adrian
Publicado: (2024)

An improved spectral lower bound of treewidth
por: Gima, Tatsuya, et al.
Publicado: (2024)