Copertina

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	An, Shinwoo, Chang, Yeonsu, Cho, Kyungjin, Kwon, O-joung, Lee, Myounghwan, Oh, Eunjin, Shin, Hyeonjun
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
di: Chang, Yeonsu, et al.
Pubblicazione: (2023)

Dynamic parameterized problems on unit disk graphs
di: An, Shinwoo, et al.
Pubblicazione: (2024)

Mimicking Networks for Constrained Multicuts in Hypergraphs
di: Cho, Kyungjin, et al.
Pubblicazione: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
di: An, Shinwoo, et al.
Pubblicazione: (2024)

Moderately beyond clique-width: reduced component max-leaf and related parameters
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
di: An, Shinwoo, et al.
Pubblicazione: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
di: An, Shinwoo, et al.
Pubblicazione: (2025)

Sparse Outerstring Graphs Have Logarithmic Treewidth
di: An, Shinwoo, et al.
Pubblicazione: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
di: Piecyk, Marta, et al.
Pubblicazione: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
di: Park, Seongbin, et al.
Pubblicazione: (2026)

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

Forcing a unique minimum spanning tree and a unique shortest path
di: Gima, Tatsuya, et al.
Pubblicazione: (2025)

Exact recovery of planted cliques in semi-random graphs
di: Khanna, Yash
Pubblicazione: (2020)

A characterization of graphs of radius-$r$ flip-width at most $2$
di: Chang, Yeonsu, et al.
Pubblicazione: (2023)

Minimum sum vertex cover: kernelization and parameterized algorithms
di: Cao, Yixin, et al.
Pubblicazione: (2024)

Planted clique recovery in random geometric graphs
di: Avrachenkov, Konstantin, et al.
Pubblicazione: (2025)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2023)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
di: Jaberi, Raed, et al.
Pubblicazione: (2024)

Partitioning graphs with linear minimum degree
di: Jie Ma, et al.
Pubblicazione: (2024)

Kick the cliques
di: Berthe, Gaétan, et al.
Pubblicazione: (2024)

Constructing self-referential instances for the clique problem
di: Li, Jiaqi, et al.
Pubblicazione: (2026)

DAG Covers: The Steiner Point Effect
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
di: Grigoriev, Alexander, et al.
Pubblicazione: (2025)

The hitting time of clique factors
di: Annika Heckel, et al.
Pubblicazione: (2024)

On the typical structure of graphs not containing a fixed vertex‐critical subgraph
di: Oren Engelberg, et al.
Pubblicazione: (2024)

Liar's vertex-edge domination in unit disk graph
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2025)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
di: Dallard, Clément, et al.
Pubblicazione: (2024)

Algorithmic study on liar's vertex-edge domination problem
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2023)

Data reduction for directed feedback vertex set on graphs without long induced cycles
di: Dirks, Jona, et al.
Pubblicazione: (2023)

Scalable $k$-clique Densest Subgraph Search
di: Ye, Xiaowei, et al.
Pubblicazione: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
di: Austrin, Per, et al.
Pubblicazione: (2024)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2022)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
di: Censor-Hillel, Keren, et al.
Pubblicazione: (2025)

Range Counting Oracles for Geometric Problems
di: Driemel, Anne, et al.
Pubblicazione: (2025)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
di: Czyżewska, Jadwiga, et al.
Pubblicazione: (2025)

Aggregating maximal cliques in real-world graphs
di: Alon, Noga, et al.
Pubblicazione: (2025)

A polynomial kernel for vertex deletion into bipartite permutation graphs
di: Derbisz, Jan
Pubblicazione: (2021)

Upper bounds on the theta function of random graphs
di: Feige, Uriel, et al.
Pubblicazione: (2025)