Sciweavers

1149 search results - page 22 / 230
» Minimally non-Pfaffian graphs
Sort
View
DAM
2008
78views more  DAM 2008»
13 years 9 months ago
On classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
Arnaud Pêcher, Annegret Wagler
PVLDB
2008
167views more  PVLDB 2008»
13 years 8 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 1 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 4 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang