arXiv (All)
open access
Core stability recognition for minimum-cost spanning tree games: Parameterized perspective
Minimum-cost spanning tree game (MSTG) is a cooperative game played on an undirected edge-weighted graph $(G,w)$ representing the network, where each vertex corresponds to a player and each edge has an associated cost~$w$. A distinguished vertex $s \in V(G)$ represents the supply or source. For any
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
- Decentralised Plug-and-Play Stability Conditions for AC Grids-Part II: Unstable Subsystems#975378
- Evaluating Stability Assessment Methods for Decision Trees#368829
- Decentralised Plug-and-Play Stability Conditions for AC Grids-Part I#975364
- WallZero: Mastering the Game of WallGo with Strategic Analysis#282814
- DistributedDesignOptimizer: A modular Python framework for Setup, Execution and Processing of Distributed Design Optimization#1106145
Record · ID 1034790
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