6740 search results - page 233 / 1348 » An s -Hamiltonian Line Graph Problem |
115
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
91
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
80
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
116
click to vote
RSA
2008
15 years 4 days ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
132
click to vote
PVLDB
2008
14 years 11 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...