40 search results - page 5 / 8 » A Relational View of Subgraph Isomorphism |
SYNTHESE
2010
13 years 6 months ago
2010
Recent work in the philosophy of science has generated an apparent conflict between theories attempting to explicate the nature of scientific representation. On one side, there are...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
JAR
2002
13 years 7 months ago
2002
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
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...
DM
2011
13 years 2 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...