Finding cliques and dense subgraphs using edge queries
Fuente:
arXiv
Saved in:
| Main Authors: | Csóka, Endre, Pongrácz, András |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
by: Chatterjee, Arnab
Published: (2025)
by: Chatterjee, Arnab
Published: (2025)
Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)
by: Chatterjee, Arnab, et al.
Published: (2025)
Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)
by: Gamarnik, David, et al.
Published: (2025)
WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)
by: Berenbrink, Petra, et al.
Published: (2024)
Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)
by: Gollin, J. Pascal, et al.
Published: (2023)
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
by: Askari, Siavash, et al.
Published: (2024)
by: Askari, Siavash, et al.
Published: (2024)
The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)
by: Chatterjee, Arnab, et al.
Published: (2025)
Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
by: Diamond, Harvey, et al.
Published: (2024)
by: Diamond, Harvey, et al.
Published: (2024)
Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
by: Diamond, Harvey, et al.
Published: (2024)
by: Diamond, Harvey, et al.
Published: (2024)
Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)
by: Enright, Jessica, et al.
Published: (2021)
Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)
by: Dijkstra, Lukas, et al.
Published: (2022)
Exploring the space of graphs with fixed discrete curvatures
by: Roost, Michelle, et al.
Published: (2024)
by: Roost, Michelle, et al.
Published: (2024)
Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)
by: Bellitto, Thomas, et al.
Published: (2022)
Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
by: Müller, Noela, et al.
Published: (2024)
by: Müller, Noela, et al.
Published: (2024)
Dirac's theorem and the switch geometry of perfect matchings
by: Kang, Ross J., et al.
Published: (2026)
by: Kang, Ross J., et al.
Published: (2026)
Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)
by: Thilikos, Dimitrios M., et al.
Published: (2023)
W-state graphs: Structure and Algorithms
by: Gajjala, Rishikesh, et al.
Published: (2026)
by: Gajjala, Rishikesh, et al.
Published: (2026)
On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)
by: Carter, Daniel
Published: (2024)
The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)
by: Molloy, Michael, et al.
Published: (2022)
Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)
by: Kirousis, Lefteris, et al.
Published: (2022)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)
by: Furmańczyk, Hanna, et al.
Published: (2020)
Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)
by: Rusu, Irena
Published: (2026)
Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)
by: Gravner, Janko, et al.
Published: (2025)
The hard-core model in graph theory
by: Davies, Ewan, et al.
Published: (2025)
by: Davies, Ewan, et al.
Published: (2025)
Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)
by: Carter, Daniel, et al.
Published: (2025)
The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
by: Mehiri, El-Mehdi
Published: (2025)
by: Mehiri, El-Mehdi
Published: (2025)
The Mutual-Visibility Problem In Directed Graphs
by: Stojanović, Vanja
Published: (2026)
by: Stojanović, Vanja
Published: (2026)
Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)
by: Barvinok, Alexander
Published: (2025)
Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
by: Roucairol, Milo, et al.
Published: (2024)
by: Roucairol, Milo, et al.
Published: (2024)
Supermodular Maximization with Cardinality Constraints
by: Chen, Xujin, et al.
Published: (2025)
by: Chen, Xujin, et al.
Published: (2025)
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)
by: Jerrum, Mark
Published: (2021)
Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)
by: Forte, Vinicius L. do, et al.
Published: (2022)
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
Temporal Exploration of Random Spanning Tree Models
by: Baguley, Samuel, et al.
Published: (2025)
by: Baguley, Samuel, et al.
Published: (2025)
Regular $K_3$-irregular graphs
by: Hak, Artem, et al.
Published: (2025)
by: Hak, Artem, et al.
Published: (2025)
Finding happiness by evolutionary algorithms
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
Similar Items
-
Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
by: Chatterjee, Arnab
Published: (2025) -
Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025) -
Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025) -
WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024) -
Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)