Sciweavers

2981 search results - page 434 / 597
» Word Sense and Subjectivity
Sort
View
TALG
2008
67views more  TALG 2008»
15 years 6 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
TALG
2008
97views more  TALG 2008»
15 years 6 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ANOR
2005
118views more  ANOR 2005»
15 years 6 months ago
Multitiered Supply Chain Networks: Multicriteria Decision - Making Under Uncertainty
: In this paper, we present a supply chain network model with multiple tiers of decision-makers, consisting, respectively, of manufacturers, distributors, and retailers, who can co...
June Dong, Ding Zhang, Hong Yan, Anna Nagurney
TCS
2008
15 years 6 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
JCT
2007
111views more  JCT 2007»
15 years 6 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky