1605 search results - page 107 / 321 » On Partitional Labelings of Graphs |
75
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
104
Voted
COMBINATORICS
2007
15 years 18 days ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
88
Voted
JCT
2006
15 years 17 days ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
101
Voted
ICPADS
2005
IEEE
15 years 6 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
120
Voted
ICMCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...