Sciweavers

1027 search results - page 39 / 206
» Ordered Vertex Partitioning
Sort
View
DAM
2011
14 years 10 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 4 months ago
On the number of rectangular partitions
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
IJCAI
2003
15 years 4 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
COMBINATORICS
2000
49views more  COMBINATORICS 2000»
15 years 2 months ago
A Short Proof of a Partition Relation for Triples
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
Albin L. Jones
SAC
2005
ACM
15 years 8 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon