6740 search results - page 284 / 1348 » An s -Hamiltonian Line Graph Problem |
119
Voted
GBRPR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
118
Voted
COLOGNETWENTE
2009
15 years 2 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
94
Voted
COMGEO
2007
ACM
15 years 1 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
124
Voted
GFKL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
128
Voted
WABI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...