596 search results - page 20 / 120 » Complexity Analysis by Graph Rewriting |
AMW
2010
13 years 9 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
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...
GD
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...
WADS
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...