Image de couverture de livre

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Grigoriev, Alexander, Kobayashi, Yasuaki, Tamaki, Hisao, van der Zanden, Tom C.
Format:	Preprint
Publié:	2025
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

Fast and Practical Single-Exponential Algorithms for Branchwidth
par: Kaneda, Taiki, et autres
Publié: (2026)

Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
par: Golak, Julian, et autres
Publié: (2025)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Aggregating maximal cliques in real-world graphs
par: Alon, Noga, et autres
Publié: (2025)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2020)

The complexity of testing all properties of planar graphs, and the role of isomorphism
par: Basu, Sabyasachi, et autres
Publié: (2021)

Exact recovery of planted cliques in semi-random graphs
par: Khanna, Yash
Publié: (2020)

2-Layer Fan-Planarity in Polynomial Time
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Planted clique recovery in random geometric graphs
par: Avrachenkov, Konstantin, et autres
Publié: (2025)

Forcing a unique minimum spanning tree and a unique shortest path
par: Gima, Tatsuya, et autres
Publié: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Kick the cliques
par: Berthe, Gaétan, et autres
Publié: (2024)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
par: An, Shinwoo, et autres
Publié: (2024)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
par: Biedl, Therese
Publié: (2025)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Hitting Geodesic Intervals in Structurally Restricted Graphs
par: Gima, Tatsuya, et autres
Publié: (2025)

Finding One Local Optimum Is Easy -- but What About Two?
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Recognizing 2-Layer and Outer $k$-Planar Graphs
par: Kobayashi, Yasuaki, et autres
Publié: (2024)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Computing diverse pair of solutions for tractable SAT
par: Gima, Tatsuya, et autres
Publié: (2024)

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

Scalable $k$-clique Densest Subgraph Search
par: Ye, Xiaowei, et autres
Publié: (2024)

Practical algorithms for Hierarchical overlap graphs
par: Talera, Saumya, et autres
Publié: (2024)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

Strassen's algorithm via orbit flip graphs
par: Ikenmeyer, Christian, et autres
Publié: (2025)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
par: Kratsch, Stefan
Publié: (2026)

Faster algorithms for packing forests in graphs and related problems
par: Arkhipov, Pavel, et autres
Publié: (2024)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
par: Tran, Nguyen Khoa, et autres
Publié: (2026)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

Enumerating all minimal hitting sets in polynomial total time
par: Wild, Marcel
Publié: (2023)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

A customizable inexact subgraph matching algorithm for attributed graphs
par: Benko, Tatyana, et autres
Publié: (2025)

The Complexity of Maximal Common Subsequence Enumeration
par: Buzzega, Giovanni, et autres
Publié: (2025)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
par: Liu, Gangli
Publié: (2024)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
par: Fang, Qiming, et autres
Publié: (2026)

Single-Source Regular Path Querying in Terms of Linear Algebra
par: Belyanin, Georgiy, et autres
Publié: (2024)