Sciweavers

2503 search results - page 35 / 501
» A study of 3-arc graphs
Sort
View
DAM
2010
132views more  DAM 2010»
13 years 9 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...
FLAIRS
2006
13 years 11 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 4 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
ENTCS
2006
168views more  ENTCS 2006»
13 years 9 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
12 years 3 days ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...