6740 search results - page 255 / 1348 » An s -Hamiltonian Line Graph Problem |
110
click to vote
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
124
click to vote
AAAI
2000
15 years 2 months ago
2000
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
102
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
83
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
93
Voted
SSS
2009
Springer
15 years 7 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...