Sciweavers

6740 search results - page 24 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
BMCBI
2004
120views more  BMCBI 2004»
13 years 7 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 4 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
DAM
2010
111views more  DAM 2010»
13 years 7 months ago
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
Louis Esperet, John Gimbel, Andrew King
WSC
2008
13 years 10 months ago
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Weida Xu, Tianyuan Xiao
COMGEO
2008
ACM
13 years 7 months ago
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...