The complexity of L(p,q)-Edge-Labelling

08/27/2020

∙

We classify the complexity of L(p,q)-Edge-k-Labelling in the sense that for all positive integers p and q we exhibit k so that we can show L(p,q)-Edge-k-Labelling is NP-complete.

READ FULL TEXT

The complexity of L(p,q)-Edge-Labelling

Acyclic, Star, and Injective Colouring: Bounding the Diameter

Auto-labelling of Markers in Optical Motion Capture by Permutation Learning

Generalization of metric classification algorithms for sequences classification and labelling

LabelSens: Enabling Real-time Sensor Data Labelling at the point of Collection on Edge Computing

LabelSens: Enabling Real-time Sensor Data Label-ling at the point of Collection on Edge Computing

Financial Numeric Extreme Labelling: A Dataset and Benchmarking for XBRL Tagging

Count, Crop and Recognise: Fine-Grained Recognition in the Wild

The complexity of L(p,q)-Edge-Labelling

Related Research

Acyclic, Star, and Injective Colouring: Bounding the Diameter

Auto-labelling of Markers in Optical Motion Capture by Permutation Learning

Generalization of metric classification algorithms for sequences classification and labelling

LabelSens: Enabling Real-time Sensor Data Labelling at the point of Collection on Edge Computing

LabelSens: Enabling Real-time Sensor Data Label-ling at the point of Collection on Edge Computing

Financial Numeric Extreme Labelling: A Dataset and Benchmarking for XBRL Tagging

Count, Crop and Recognise: Fine-Grained Recognition in the Wild