163
Voted
WG
15 years 7 months ago
2005 Springer 
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
107
click to vote
WG
15 years 7 months ago
2005 Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
128
click to vote
WG
15 years 7 months ago
2005 Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
108
click to vote
WG
15 years 7 months ago
2005 Springer 
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
109
click to vote
WG
15 years 7 months ago
2005 Springer 
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
|
Theoretical Computer Science