Sciweavers

3105 search results - page 242 / 621
» The Path-Packing Structure of Graphs
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 3 months ago
Track Layouts of Graphs
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
Vida Dujmovic, Attila Pór, David R. Wood
135
Voted
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
15 years 3 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
ICPR
2010
IEEE
15 years 2 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
SAC
2009
ACM
15 years 10 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
157
Voted
XSYM
2009
Springer
264views Database» more  XSYM 2009»
15 years 10 months ago
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
Massimo Franceschet, Donatella Gubiani, Angelo Mon...