1605 search results - page 22 / 321 » On Partitional Labelings of Graphs |
122
Voted
ARC
2007
Springer
15 years 6 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
127
Voted
PC
2010
15 years 1 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
142
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
134
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
129
click to vote
BIRTHDAY
2008
Springer
15 years 4 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...