Sciweavers

68 search results - page 6 / 14
» Two New Classes of Hamiltonian Graphs: (Extended Abstract)
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
KR
2010
Springer
14 years 10 days ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...
AAAI
2006
13 years 9 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...