175 search results - page 5 / 35 » max-cut and Containment Relations in Graphs |
SIAMDM
2008
13 years 7 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
2000
Springer
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic m...
ARSCOM
2007
13 years 7 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
APVIS
2001
13 years 8 months ago
2001
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...