Results 1  10
of
150,353
Strong edge coloring of planar graphs with girth at least six
, 2014
"... An edge coloring is a strong edge coloring if each path of length three uses three distinct colors. The strong chromatic index χ′s(G) of a graph G is the minimum number of colors needed in a strong edge coloring of G. In this paper, we prove that if G is a graph with ∆(G) ≤ 4 and maximum average de ..."
Abstract
 Add to MetaCart
degree less than 3, then χ′s(G) ≤ 3∆(G) + 1. Moreover, we prove that every planar graph G with girth at least 6 admits a strong edge coloring with 3∆(G) + 1 colors, which improves a result in [D. Hudák, B. Lužar, R. Soták and R. Škrekovski, Strong edgecoloring of planar graphs, Discrete Math. 324 (2014
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 534 (48 self)
 Add to MetaCart
How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include
"GrabCut”  interactive foreground extraction using iterated graph cuts
 ACM TRANS. GRAPH
, 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract

Cited by 1140 (36 self)
 Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors
Homomorphisms of 2edgecolored graphs
, 2009
"... In this paper, we study homomorphisms of 2edgecolored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2trees, partial 3trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a ..."
Abstract
 Add to MetaCart
In this paper, we study homomorphisms of 2edgecolored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2trees, partial 3trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a
Edge Detection
, 1985
"... For both biological systems and machines, vision begins with a large and unwieldy array of measurements of the amount of light reflected from surfaces in the environment. The goal of vision is to recover physical properties of objects in the scene, such as the location of object boundaries and the s ..."
Abstract

Cited by 1277 (1 self)
 Add to MetaCart
For both biological systems and machines, vision begins with a large and unwieldy array of measurements of the amount of light reflected from surfaces in the environment. The goal of vision is to recover physical properties of objects in the scene, such as the location of object boundaries
Extremal Problems on Edge_Colorings, . . . CYCLE SPECTRA OF GRAPHS
, 2010
"... We study problems in extremal graph theory with respect to edgecolorings, independent sets, and cycle spectra. In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree. In Chapter 4, we study a Ramseytype problem on edgelabeled trees, whe ..."
Abstract
 Add to MetaCart
We study problems in extremal graph theory with respect to edgecolorings, independent sets, and cycle spectra. In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree. In Chapter 4, we study a Ramseytype problem on edgelabeled trees
Results 1  10
of
150,353