arXiv (All)
open access
Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture
Although the Maximum Clique Problem (MCP) has been extensively studied and features a rich ecosystem of exact solvers, empirical evidence shows that solver performance varies substantially across graph families. Consequently, selecting an appropriate algorithm for a given instance remains an open an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning#1144944
- Hardness of Multi-Agent Path Finding on Trees: A Unified Approach#821898
- Fast approximate shortest paths in the congested clique#301330
- MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search#134637
Record · ID 986789
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive