18 search results - page 3 / 4 » Vertex Coverings by Coloured Induced Graphs - Frames and Umb... |
75
Voted
IPL
2000
14 years 11 months ago
2000
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
MOR
2010
14 years 10 months ago
2010
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
111
click to vote
CONSTRAINTS
2007
14 years 11 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
88
Voted
TCS
2008
14 years 11 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...