Results 281 to 290 of about 272,983 (311)
Some of the next articles are maybe not open access.

The NP-Completeness of Edge-Coloring

SIAM Journal on Computing, 1981
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.
openaire   +2 more sources

Theory-Contraction is NP-Complete

Logic Journal of IGPL, 2003
Summary: The author investigates the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependency-networks is non-trivial, especially ...
openaire   +1 more source

BoxOff is NP-Complete

2022
Ryan Hayward   +2 more
openaire   +1 more source

Knowledge Graph Completeness: A Systematic Literature Review

IEEE Access, 2021
Subhi Issa   +2 more
exaly  

Quantifying sample completeness and comparing diversities among assemblages

Ecological Research, 2020
Anne Chao   +2 more
exaly  

An empirical study of the antecedents of data completeness in electronic medical records

International Journal of Information Management, 2020
Caihua Liu   +2 more
exaly  

Defining and measuring completeness of electronic health records for secondary use

Journal of Biomedical Informatics, 2013
Nicole G Weiskopf   +2 more
exaly  

Quantification of the completeness of follow-up

Lancet, The, 2002
Taane G Clark   +2 more
exaly  

Home - About - Disclaimer - Privacy