3396 search results - page 471 / 680 » Tree representations of graphs |
194
click to vote
WG
1995
Springer
15 years 10 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
191
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data for...
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
186
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...