作  者
期刊 & 会议
 
年  份
 
Michael Jablonski 的引文(5) 排序方式:
Threshold and complexity results for the cover pebbling game  
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number......
Discrete Mathematics  2009
2次引用 0 0
On the pebbling threshold of paths and the pebbling threshold spectrum  
Abstract A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a......
Discrete Mathematics  2008
1次引用 0 0
Girth, Pebbling, and Grid Thresholds  
Abstract The pebbling number of a graph is the smallest number t such that from any initial conguration of t pebbles one can move a pebble to any prescribed vertex by a sequence of pebbling steps. It ......
Siam Journal on Discrete Mathematics  2006
1次引用 0 0
Recent progress in graph pebbling  
The subject of graph pebbling has seen dramatic growth recently, both in the number of publications and in the breadth of variations and applications. Here we update the reader on the many development......
Graph Theory Notes N. Y  2005
4次引用 0 0
"Better design through modeling and measurement" My research focuses on using mathematical models to provide insight into the design of computer systems. I apply analytic models and tools that are traditionally used in the operations research community in order to evaluate the impact of design decisions in systems such as web servers, server farms, routers, databases, and beyond. My work applies and often extends techniques in stochastic modeling, queueing theory, scheduling theory, and game theory  
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜