1857 search results - page 95 / 372 » Minimum Degree Orderings |
173
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
171
click to vote
FUIN
2006
15 years 6 months ago
2006
Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these ...
151
click to vote
SIAMDM
2008
15 years 6 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
139
click to vote
JGAA
2007
15 years 6 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
196
click to vote
EDBT
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...