HAL (France)
open access
An FPT Algorithm for the Embeddability of Graphs Into Two-Dimensional Simplicial Complexes
We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is homeomorphic to a surface. We prove that the problem is fixed-paramete
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
- Evaluating Graph Neural Networks for Change-Criticality Classification in Maritime Navigation Charts#925369
- Evaluating Graph Neural Networks for Change-Criticality Classification in Maritime Navigation Charts#921133
- Multi-Contact Force Estimation for Continuum Robots via Gaussian-Parameterized Factor Graphs#971829
- 3D-bioprinted microenvironments shape the growth and IgG1 monoclonal antibody production of CHO DG44 cells#1158045
- An FPT algorithm for cycle rank on semi-complete digraphs#1062946
Record · ID 1203829
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