Results 1  10
of
123,538
Interval edgecolorings of cubic graphs
, 2016
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Interval cyclic edgecolorings of graphs
"... A proper edgecoloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ()v V G are colored with () G d v consecutive colors by modulo t, where () G d v is the degree of the vertex v in G. In this paper some pr ..."
Abstract
 Add to MetaCart
A proper edgecoloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ()v V G are colored with () G d v consecutive colors by modulo t, where () G d v is the degree of the vertex v in G. In this paper some
Edgecolorings
"... and circular flow numbers on regular graphs Eckhard Steffen∗ The paper characterizes (2t + 1)regular graphs with circular flow number 2 + 22t−1. For t = 1 this is Tutte’s characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a f ..."
Abstract
 Add to MetaCart
and circular flow numbers on regular graphs Eckhard Steffen∗ The paper characterizes (2t + 1)regular graphs with circular flow number 2 + 22t−1. For t = 1 this is Tutte’s characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a
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
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
, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should
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
Interval edgecolorings of complete graphs
, 2014
"... An edgecoloring of a graph G with colors 1, 2,..., t is an interval tcoloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval tcoloring for some positive integer t. Fo ..."
Abstract
 Add to MetaCart
An edgecoloring of a graph G with colors 1, 2,..., t is an interval tcoloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval tcoloring for some positive integer t
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
and the structure, color and texture of object surfaces, from the twodimensional image that is projected onto the eye or camera. This goal is not achieved in a single step; vision proceeds in stages, with each stage producing increasingly more useful descriptions of the image and then the scene. The first clue
On the EdgeColoring of Split Graphs
, 1996
"... We consider the following question: can split graphs with odd maximum degree be edgecoloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case the grap ..."
Abstract
 Add to MetaCart
We consider the following question: can split graphs with odd maximum degree be edgecoloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case
Results 1  10
of
123,538