1461 search results - page 126 / 293 » Complexity of Graph Covering Problems |
96
Voted
FLAIRS
2008
15 years 4 months ago
2008
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
106
Voted
WAW
2009
Springer
15 years 9 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
COR
2006
15 years 2 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
158
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
122
click to vote
VIZSEC
2005
Springer
15 years 8 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...