Results 271 to 280 of about 152,670 (312)
JMIR Res ProtocSome of the next articles are maybe not open access.
Related searches:
Related searches:
Colorization by Matrix Completion
Proceedings of the AAAI Conference on Artificial Intelligence, 2021Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a novel approach to the colorization problem by formulating it as a matrix completion problem.
Shusen Wang, Zhihua Zhang
openaire +1 more source
Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Tingting +3 more
openaire +2 more sources
2019
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjacent vertices with these colors. This observation has led to a coloring called a complete coloring, which is the primary topic of this chapter.
Chartrand, Gary +3 more
openaire +2 more sources
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjacent vertices with these colors. This observation has led to a coloring called a complete coloring, which is the primary topic of this chapter.
Chartrand, Gary +3 more
openaire +2 more sources
$$[1,1,t]$$ -Colorings of Complete Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kemnitz, Arnfried +2 more
openaire +2 more sources
Coloring Block Designs is NP-Complete
SIAM Journal on Algebraic Discrete Methods, 1982Coloring partial Steiner triple systems is shown to be NP-complete. Together with an embedding technique of Lindner, this provides a short proof of the NP-completeness of coloring block designs.
Colbourn, Charles J. +3 more
openaire +1 more source