Results 261 to 270 of about 978,529 (303)
Multiomic characterization of response and resistance to neoadjuvant chemoradiotherapy in esophageal squamous cell carcinoma. [PDF]
Transl Cancer ResLi Y +6 more
europepmc +1 more source
Modeling identities among the first-sedentary communities: Emergence of clay personal ornaments in Epipaleolithic Southwest Asia. [PDF]
Sci AdvDavin L +9 more
europepmc +1 more source
Disentangling beauty and attractiveness in art portraits: Differential links to quantitative image properties. [PDF]
IperceptionHayn-Leichsenring GU.
europepmc +1 more source
Electronic and molecular dynamics mechanisms of wogonin adsorption on graphene nanocarriers. [PDF]
Sci RepLi X +7 more
europepmc +1 more source
Metal-center electron affinity modulates multicolor electrochromism in 2D conjugated metal-organic frameworks. [PDF]
Nat CommunZhao Q +14 more
europepmc +1 more source
On Edge Coloring Bipartite Graphs [PDF]
SIAM Journal on Computing, 1982 The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.
John Edward Hopcroft, Richard J. Cole
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1990
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Odile Marcotte, Paul D. Seymour
openaire +2 more sources
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Odile Marcotte, Paul D. Seymour
openaire +2 more sources
Pattern Recognition Letters, 1985
The detection of visually significant edges and boundaries in a natural color image is complicated by inherent noise and correlation between color coordinates. In this letter we present a color edge detector which uses fuzzy set theory to model this imprecision.
Terrance L. Huntsberger, M. F. Descalzi
openaire +2 more sources
The detection of visually significant edges and boundaries in a natural color image is complicated by inherent noise and correlation between color coordinates. In this letter we present a color edge detector which uses fuzzy set theory to model this imprecision.
Terrance L. Huntsberger, M. F. Descalzi
openaire +2 more sources
ColorED: Color edge and segment detection by Edge Drawing (ED)
Journal of Visual Communication and Image Representation, 2017Abstract We extend our recent edge and segment detector, Edge Drawing (GrayED), to detect edge segments in color images. Edge Drawing for color images, named ColorED, takes in a color image, and outputs a set of edge segments, each a contiguous, 1-pixel wide chain of pixels.
Cuneyt Akinlar, Cihan Topal
openaire +3 more sources
2007
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source