Scheduling wireless links by graph multicoloring in the physical interference model¶
Vieira, F. R. J., de Rezende, J. F., & Barbosa, V. C. (2015). Scheduling wireless links by graph multicoloring in the physical interference model.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Fractional Coloring
- A simple pairwise conflict graph is an exact fractional-coloring model only if those feasible simultaneous groups really correspond to its independent sets; otherwise a hypergraph or other model carries constraints a simple graph loses.
This sourceThis supports equal-multiplicity slot scheduling and its physical-feasibility caveat, not an unconditional equivalence between SINR feasibility and a simple graph.
- A simple pairwise conflict graph is an exact fractional-coloring model only if those feasible simultaneous groups really correspond to its independent sets; otherwise a hypergraph or other model carries constraints a simple graph loses.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:bcbbb14ff67a · see in the full table