Image de couverture de livre

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Manoussakis, George
Format:	Preprint
Publié:	2019
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New results for the detection of bicliques
par: Manoussakis, George
Publié: (2024)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
par: Akhtar, Sheikh Shakil, et autres
Publié: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
par: Floros, Dimitris, et autres
Publié: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
par: Crane, Alex, et autres
Publié: (2026)

Parameterized Algorithms for Minimum Sum Vertex Cover
par: Aute, Shubhada, et autres
Publié: (2024)

Edit and Alphabet-Ordering Sensitivity of Lex-parse
par: Nakashima, Yuto, et autres
Publié: (2024)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
par: Xiong, Ziliang, et autres
Publié: (2024)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
par: Kumar, Mithilesh, et autres
Publié: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
par: Bougeret, Marin, et autres
Publié: (2025)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
par: Gupta, Sushmita, et autres
Publié: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
par: Esmer, Barış Can, et autres
Publié: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
par: Kobayashi, Yusuke, et autres
Publié: (2026)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
par: Bentert, Matthias, et autres
Publié: (2024)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
par: Assadi, Sepehr, et autres
Publié: (2025)

Risk-Sensitive Online Algorithms
par: Christianson, Nicolas, et autres
Publié: (2024)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
par: Dalirrooyfard, Mina, et autres
Publié: (2023)

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
par: Saito, Rin, et autres
Publié: (2025)

Structural Parameterizations of Vertex Integrity
par: Gima, Tatsuya, et autres
Publié: (2023)

Faster Parameterized Vertex Multicut
par: Chu, Huairui, et autres
Publié: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
par: Armbruster, Susanne, et autres
Publié: (2024)

Dynamic Locality Sensitive Orderings in Doubling Metrics
par: La, An, et autres
Publié: (2024)

Faster Deterministic Streaming Vertex Coloring
par: Chechik, Shiri, et autres
Publié: (2026)

Dynamic $(Δ+ 1)$ Vertex Coloring
par: Benson-Tilsen, Noam
Publié: (2026)

Weighted Partition Vertex and Edge Cover
par: Dabas, Rajni, et autres
Publié: (2025)

Cluster Vertex Deletion on Chordal Graphs
par: Cao, Yixin, et autres
Publié: (2026)

Composition Orderings for Linear Functions and Matrix Multiplication Orderings
par: Kubo, Susumu, et autres
Publié: (2024)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
par: Eisenbrand, Friedrich, et autres
Publié: (2024)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Quadratic Kernel for Cliques or Trees Vertex Deletion
par: Kumabe, Soh
Publié: (2025)

Expander Decomposition for Non-Uniform Vertex Measures
par: Agassy, Daniel, et autres
Publié: (2025)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
par: Cervenjak, Philip, et autres
Publié: (2026)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
par: Manoharan, Vignesh, et autres
Publié: (2025)

Capacitated Partition Vertex Cover and Partition Edge Cover
par: Dabas, Rajni, et autres
Publié: (2025)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
par: Neiman, Ofer, et autres
Publié: (2026)

The Connected k-Vertex One-Center Problem on Graphs
par: Zhang, Jingru
Publié: (2024)