arXiv (All)
open access
Connected (Dense) Partition for Tree-Like Graphs
We focus on two variants of graph partitioning problems, connected partition and dense partition. Formally, given a graph $G=(V,E)$ and a partition of its vertices $\mathcal P=\{P_1,\ldots, P_k\}$ we say that $\mathcal P$ is a connected partition of $G$ if each $P_i$ induces a connected graph in $G$
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
- Partitionability is NP-complete#1402471
- Entropy and the growth rate of universal covering trees#183167
- Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees#1200071
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups#819557
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups#809561
Record · ID 1402235
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