656 search results - page 9 / 132 » Graph Theoretical Characterization and Computation of Answer... |
115
click to vote
DM
2006
15 years 1 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
122
click to vote
DAM
2011
14 years 8 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
WG
2005
Springer
15 years 6 months ago
2005
Springer
108
click to vote
AMW
2009
15 years 2 months ago
2009
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
117
click to vote
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...