1952 search results - page 94 / 391 » Complete partitions of graphs |
137
click to vote
TAGT
1994
Springer
15 years 8 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
109
click to vote
IWOCA
2009
Springer
15 years 10 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...
139
click to vote
COMBINATORICS
2007
15 years 4 months 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. ...
116
click to vote
JCT
2006
15 years 4 months 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...
128
click to vote
ICPADS
2005
IEEE
15 years 9 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...