553 search results - page 64 / 111 » Cover Contact Graphs |
96
Voted
IFIP12
2007
15 years 2 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
121
click to vote
CONSTRAINTS
2007
15 years 16 days ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
108
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...
110
click to vote
JMLR
2006
15 years 15 days ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
111
Voted
JGAA
2000
15 years 10 days ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...