5473 search results - page 212 / 1095 » On the graph isomorphism problem |
169
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
200
click to vote
COLOGNETWENTE
2009
15 years 8 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...
178
click to vote
COMGEO
2007
ACM
15 years 7 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...
219
click to vote
GFKL
2005
Springer
16 years 22 days 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...
213
click to vote
WABI
2010
Springer
15 years 5 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...