Topic

05c85

Knowledge-graph topic · documents ABOUT 05c85 across the archive

35Documents about 05c85

Documents about 05c85

Arboricity Nearly Bounds Degeneracy#616345arXiv (OAI Expanded)
Arboricity Nearly Bounds Degeneracy#616845arXiv (All)
Fort Abundance in Zero Forcing#999442arXiv (All)
A Counterexample to Teschner's Bondage-Number Conjecture#927557arXiv (All)
A complete classification of metrizable and strictly metrizable theta graphs#987710arXiv (All)
Fractional list packing for layered graphs#131249arXiv (OAI)
Extensions of Courcelle's Theorem without Logic#661205arXiv (OAI Expanded)
Extensions of Courcelle's Theorem without Logic#662255arXiv (All)
Ordered Ruzsa-Szemeredi Numbers at Matching Size Two#793857arXiv (All)
A note on efficient k-limited broadcast domination in graphs#656873arXiv (OAI Expanded)
A note on efficient k-limited broadcast domination in graphs#659009arXiv (All)
An Overview of Universal Obstructions for Graph Parameters#189015arXiv
An Overview of Universal Obstructions for Graph Parameters#189065arXiv Biology
An Overview of Universal Obstructions for Graph Parameters#189115arXiv (OAI Expanded)
An Overview of Universal Obstructions for Graph Parameters#189165arXiv (OAI)
Colorful Minors#927142arXiv (All)
Recognizing Level-k-Based Phylogenetic Networks is NP-Complete#650873arXiv (OAI Expanded)
Recognizing Level-k-Based Phylogenetic Networks is NP-Complete#652326arXiv (All)
The Erdős-Pósa Property for Colorful Minors#971921arXiv (All)
Exact Ordered Ruzsa-Szemeredi Numbers for Matchings of Size Two#609128arXiv (OAI Expanded)
The Cayley Completion of a Graph#808941arXiv (OAI Expanded)
The Cayley Completion of a Graph#818933arXiv (All)
Computable Ergodic Optimisation#996923arXiv (All)
Nilpotent representations over equioriented cyclic quivers#622934arXiv (OAI Expanded)
Nilpotent representations over equioriented cyclic quivers#625207arXiv (All)
Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#919982arXiv (OAI Expanded)
Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#924213arXiv (All)
Algorithmic Simplification for Million-Vertex Diffusion History Reconstruction#789179arXiv (OAI Expanded)
Algorithmic Simplification for Million-Vertex Diffusion History Reconstruction#793183arXiv (All)
On the Instance Optimality of Bidirectional Dijkstra's Algorithm#820644arXiv (All)
Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels#820895arXiv (All)
A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem#622916arXiv (OAI Expanded)
A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem#625189arXiv (All)
Cluster deletion and clique partitioning in graphs with bounded clique number#617322arXiv (OAI Expanded)
Cluster deletion and clique partitioning in graphs with bounded clique number#617822arXiv (All)
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#661036arXiv (OAI Expanded)
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#662086arXiv (All)
Unveiling Hidden Threats: Using Fractal Triggers to Boost Stealthiness of Distributed Backdoor Attacks in Federated Learning#974259arXiv (All)

Topic record · derived from the Conceptio knowledge graph (shared subject terms across the corpus)
Conceptio Open Knowledge Archive — topic hubs link to canonical document pages with full provenance.