796 search results - page 107 / 160 » Graph Properties Based Filtering |
140
click to vote
FSTTCS
2010
Springer
15 years 16 days ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
128
click to vote
WWW
2011
ACM
14 years 9 months ago
2011
ACM
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
122
click to vote
MST
2010
14 years 9 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
126
Voted
ICAIL
2007
ACM
15 years 6 months ago
2007
ACM
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...
151
Voted
SAC
2002
ACM
15 years 2 months ago
2002
ACM
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...