Sciweavers

128 search results - page 24 / 26
» Isomorphic Subgraphs
Sort
View
WWW
2003
ACM
16 years 2 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
138
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 4 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
DIAGRAMS
2004
Springer
15 years 7 months ago
Decision Diagrams in Machine Learning: An Empirical Study on Real-Life Credit-Risk Data
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
Christophe Mues, Bart Baesens, Craig M. Files, Jan...
120
Voted
EJC
2008
15 years 1 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
107
Voted
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
15 years 1 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...