Sciweavers

1097 search results - page 106 / 220
» Testing Graph Isomorphism
Sort
View
DAC
1998
ACM
15 years 11 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
PPAM
2005
Springer
15 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
SEMWEB
2005
Springer
15 years 3 months ago
Gnowsis Adapter Framework: Treating Structured Data Sources as Virtual RDF Graphs
The integration of heterogenous data sources is a crucial step for the upcoming semantic web – if existing information is not integrated, where will the data come from that the s...
Leo Sauermann, Sven Schwarz
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Efficient octilinear Steiner tree construction based on spanning graphs
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Y...
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
15 years 2 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya