Sciweavers

44 search results - page 2 / 9
» (p, 1)-Total labelling of graphs
Sort
View
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 5 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
13 years 11 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
13 years 11 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
INFORMATICALT
2006
104views more  INFORMATICALT 2006»
13 years 5 months ago
Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar Graphs
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
Auparajita Krishnaa, Manohar Singh Dulawat
DM
2002
102views more  DM 2002»
13 years 4 months ago
Totally magic graphs
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, ...