Cover Image

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Santos, Daniela Scherer dos, Klamroth, Kathrin, Martins, Pedro, Paquete, Luís
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ensuring connectedness for the maximum quasi‐clique and densest k ‐subgraph problems
by: Daniela Scherer dos Santos, et al.
Published: (2026)

Solving the Multiobjective Quasi-Clique Problem
by: Santos, Daniela Scherer dos, et al.
Published: (2024)

A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
by: Mota, Felipe O., et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
by: Kurapov, Sergey, et al.
Published: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
by: Xiao, Chenglong, et al.
Published: (2024)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
by: Perrotin, Pacôme, et al.
Published: (2024)

How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
by: Kenkireth, Benny George, et al.
Published: (2025)

On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
by: Wild, Marcel
Published: (2024)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Graphs without a partition into two proportionally dense subgraphs
by: Bazgan, Cristina, et al.
Published: (2018)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
by: Matuschke, Jannik
Published: (2025)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
by: Alkhouri, Ismail, et al.
Published: (2025)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Maximum $k$- vs. $\ell$-colourings of graphs
by: Nakajima, Tamio-Vesa, et al.
Published: (2023)

Colourful components in $k$-caterpillars and planar graphs
by: Chlebíková, Janka, et al.
Published: (2019)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

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

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
by: Sharman, Bharat, et al.
Published: (2025)

Solving decision problems by distributed consensus with one-dimensional, binary, radius-$2$ cellular automata over cyclic configurations
by: Ruivo, Eurico, et al.
Published: (2025)

Exploring subgraph complementation to bounded degree graphs
by: Koch, Ivo, et al.
Published: (2025)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)