ABSTRACT
No abstract available.
Index Terms
- Pregel: a system for large-scale graph processing - "ABSTRACT"
Recommendations
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
An L(2,1)-labeling of a graph G=(V,E) is a function f:V(G)->{0,1,2,...} such that |f(u)-f(v)|>=2 whenever uv@__ __E(G) and |f(u)-f(v)|>=1 whenever u and v are at distance two apart. The span of an L(2,1)-labeling f of G, denoted as SP"2(f,G), is the ...
Computing a minimum outer-connected dominating set for the class of chordal graphs
For a graph G=(V,E), a dominating set is a set D@?V such that every vertex v@?V@?D has a neighbor in D. Given a graph G=(V,E) and a positive integer k, the minimum outer-connected dominating set problem for G is to decide whether G has a dominating set ...
3-colouring for dually chordal graphs and generalisations
In this paper, we investigate the Colourability problem for dually chordal graphs and some of its generalisations. We show that the problem remains NP-complete if limited to four colours. For the case of three colours, we present a simple linear time ...
Comments