Sciweavers

3008 search results - page 153 / 602
» Independence in connected graphs
Sort
View
XSYM
2009
Springer
264views Database» more  XSYM 2009»
16 years 1 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...
CPC
2006
72views more  CPC 2006»
15 years 6 months ago
On Dependency Graphs and the Lattice Gas
We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lov
Alexander D. Scott, Alan D. Sokal
MLG
2007
Springer
16 years 17 days ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
EJC
2010
15 years 6 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
CORR
2011
Springer
174views Education» more  CORR 2011»
15 years 1 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...