Sciweavers

204 search results - page 4 / 41
» On Representations of Some Thickness-Two Graphs
Sort
View
STTT
2010
134views more  STTT 2010»
13 years 8 months ago
A case study to evaluate the suitability of graph transformation tools for program refactoring
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...
Francisco Javier Pérez, Yania Crespo, Berth...
EJC
2007
13 years 9 months ago
Representations of directed strongly regular graphs
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
Chris D. Godsil, Sylvia A. Hobart, William J. Mart...
DCG
2011
13 years 1 months ago
A Celtic Framework for Knots and Links
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
Jonathan L. Gross, Thomas W. Tucker
SPAA
2009
ACM
14 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
14 years 11 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina