Sciweavers

102 search results - page 14 / 21
» Dually Chordal Graphs
Sort
View
DM
2002
69views more  DM 2002»
13 years 7 months ago
Non-chordal graphs having integral-root chromatic polynomials II
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael...
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 1 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
DAM
2007
108views more  DAM 2007»
13 years 7 months ago
3D-interval-filament graphs
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
Fanica Gavril
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
14 years 1 months ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
ER
2004
Springer
90views Database» more  ER 2004»
14 years 1 months ago
WUML: A Web Usage Manipulation Language for Querying Web Log Data
In this paper, we develop a novel Web Usage Manipulation Language (WUML) which is a declarative language for manipulating Web log data. We assume that a set of trails formed by use...
Qingzhao Tan, Yiping Ke, Wilfred Ng