Sciweavers

6598 search results - page 50 / 1320
» Graph Theory with Applications
Sort
View
149
Voted
CLA
2007
15 years 5 months ago
Concept Graphs as Semantic Structures for Contextual Judgment Logic
Abstract. This paper presents a mathematization of the philosophical doctrine of judgments as an extension of the mathematization of the philosophical doctrine of concepts develope...
Rudolf Wille
JAPLL
2006
114views more  JAPLL 2006»
15 years 4 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
COMPGEOM
2004
ACM
15 years 9 months ago
The geometric thickness of low degree graphs
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
HOA
1993
15 years 8 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer
142
Voted
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 5 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau