Sciweavers

3267 search results - page 103 / 654
» Generalized quasirandom graphs
Sort
View
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 11 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 5 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
FLAIRS
2008
15 years 1 months ago
Graph Grammars: An ITS Technology for Diagram Representations
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
Niels Pinkwart, Kevin D. Ashley, Vincent Aleven, C...
JCT
2008
81views more  JCT 2008»
14 years 11 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
15 years 4 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez