6740 search results - page 396 / 1348 » An s -Hamiltonian Line Graph Problem |
130
click to vote
ICWS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
146
click to vote
IV
2009
IEEE
15 years 11 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
127
Voted
WAW
2009
Springer
15 years 11 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 ...
142
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
149
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...