Sciweavers

3396 search results - page 241 / 680
» Tree representations of graphs
Sort
View
LICS
2008
IEEE
14 years 4 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
BMCBI
2008
107views more  BMCBI 2008»
13 years 9 months ago
Extended Newick: it is time for a standard representation of phylogenetic networks
Background: Phylogenetic trees resulting from molecular phylogenetic analysis are available in Newick format from specialized databases but when it comes to phylogenetic networks,...
Gabriel Cardona, Francesc Rosselló, Gabriel...
ICIP
2002
IEEE
14 years 11 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie
IV
2003
IEEE
183views Visualization» more  IV 2003»
14 years 2 months ago
Visualisation of RDF(S)-based Information
As Resource Description Framework (RDF) reaches maturity, there is an increasing need for tools that support it. A common and natural representation for RDF data is a directed lab...
Alexandru Telea, Flavius Frasincar, Geert-Jan Houb...
JGT
2011
109views more  JGT 2011»
13 years 4 months ago
Total weight choosability of graphs
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
Tsai-Lien Wong, Xuding Zhu