3757 search results - page 539 / 752 » The overlap number of a graph |
178
click to vote
ISCIS
2005
Springer
16 years 1 days ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
129
click to vote
WEBI
2005
Springer
16 years 2 hour ago
2005
Springer
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
156
click to vote
CAV
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
161
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
191
click to vote
WAIM
2004
Springer
15 years 12 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...