Sciweavers

1161 search results - page 37 / 233
» Kinetic Dependence Graphs
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 18 days ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
107
Voted
WWW
2005
ACM
16 years 1 months ago
Named graphs, provenance and trust
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
RSA
2008
103views more  RSA 2008»
14 years 12 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
92
Voted
ICPR
2004
IEEE
16 years 1 months ago
Graph Method for Generating Affine Moment Invariants
A general method of systematic derivation of affine moment invariants of any weights and orders is introduced. Each invariant is expressed by its generating graph. Techniques for ...
Jan Flusser, Tomás Suk
CIE
2006
Springer
15 years 4 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler