arXiv (All)
open access
An experimental evaluation of static k-center clustering algorithms on graphs
The $k$-center problem is one of the most fundamental clustering problems and has applications in a wide range of areas, including facility location, network design, data mining, and machine learning. Given a set of objects together with a distance measure, the goal is to select $k$ centers such tha
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
- Contrastive Learning and Correlation Clustering for Sequences of Network Telescope Data#259403
- SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking#997734
- Link prediction in complex networks via fusing node centrality and local similarity indices#1012338
- GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks#986589
Record · ID 1414386
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