Results 291 to 300 of about 92,928 (333)
An Ultra-Wideband Handover System for GPS-Free Bridge Inspection Using Drones. [PDF]
Sensors (Basel)Wang PH, Wu RB.
europepmc +1 more source
Functional Connectome Correlates of Laterality Preferences: Insights into Hand, Foot, and Eye Dominance across the Lifespan. [PDF]
eNeuroTejavibulya L +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1987
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Hanson, D., Toft, B.
openaire +1 more source
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Hanson, D., Toft, B.
openaire +1 more source
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.
Marcotte, O., Seymour, P. D.
openaire +1 more source
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.
Marcotte, O., Seymour, P. D.
openaire +1 more source
ACM Transactions on Graphics, 2011
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
Journal of Algorithms, 1996
Summary: Many combinatorial problems can be efficiently solved for partial \(k\)-trees (graphs of treewidth bounded by \(k\)). The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity.
Zhou, Xiao +2 more
openaire +2 more sources
Summary: Many combinatorial problems can be efficiently solved for partial \(k\)-trees (graphs of treewidth bounded by \(k\)). The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity.
Zhou, Xiao +2 more
openaire +2 more sources
Optimal edge‐coloring with edge rate constraints
Networks, 2013We consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that ...
Dereniowski, Dariusz +3 more
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.
T.L Huntsberger, M.F Descalzi
openaire +1 more source
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.
T.L Huntsberger, M.F Descalzi
openaire +1 more source
Edge Coloring Series Parallel Graphs
Journal of Algorithms, 1995Abstract We present an algorithm for optimally edge coloring series parallel graphs. We give a linear time implementation, as well as a parallel implementation, of the algorithm that runs in O (log 3 n ) time using O ( n ) processors. The sequential implementation, which is optimal, improves the best-known algorithm. The parallel implementation of
Caspi, Yuval, Dekel, Eliezer
openaire +1 more source