Sciweavers

650 search results - page 24 / 130
» Positive graphs
Sort
View
ASP
2003
Springer
15 years 2 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
RSA
2011
126views more  RSA 2011»
14 years 4 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
DAM
2010
105views more  DAM 2010»
14 years 7 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
DIAL
2006
IEEE
103views Image Analysis» more  DIAL 2006»
15 years 3 months ago
Multi-Queue Merging Scheme And Its Application in Arabic Script Segmentation
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
Pingping Xiu, Liangrui Peng, Xiaoqing Ding
DM
2010
102views more  DM 2010»
14 years 9 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu