9532 search results - page 113 / 1907 » Logic, Graphs, and Algorithms |
126
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
CHI
2010
ACM
15 years 6 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
ICCAD
1993
IEEE
15 years 3 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
100
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...