arXiv (All)
open access
Computing markings for fuzzy minimax nets over the Gödel structure
Fuzzy minimax nets were recently introduced as a tool for computing the greatest fuzzy bisimulation and simulation between two finite fuzzy graph-based structures. In this work, we provide an efficient algorithm with time complexity $O(m + n + l\log{l})$ for computing the greatest correct marking of
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
- A Brooks-like result for graph powers $#983875
- TC*#732704
- Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fourth volume: HyperUncertain Set (Collected Papers)#713414
- Paired Disjunctive Domination Number of Middle Graphs#1012030
- A knowledge-based iterated local search for the weighted total domination problem#231605
Record · ID 1034759
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