192 search results - page 26 / 39 » On Graph Isomorphism for Restricted Graph Classes |
116
click to vote
ASAP
2010
IEEE
15 years 3 months ago
2010
IEEE
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
142
Voted
IWCIA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
95
Voted
SEMWEB
2005
Springer
15 years 7 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
CORR
2010
Springer
15 years 13 days ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
102
Voted
SWAT
1998
Springer
15 years 6 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...