Keyword

path decomposition

Description: A path decomposition is a graph-theoretic representation that arranges vertex subsets along a path while satisfying coverage and adjacency conditions.
OpenAlex ID: keywords/path-decomposition
1996 · Hans L. Bodlaender · SIAM Journal on Computing · 1,892
2016 · Andreas Veit, Michael J. Wilber, et al. · neural information processing systems · 851
2016 · Veit, Andreas, Wilber, Michael, et al. · arXiv (Cornell University) · 839
1996 · Hans L. Bodlaender, Ton Kloks · Journal of Algorithms · 372
1974 · David Williams · Proceedings of the London Mathematical Society · 370
1981 · L. C. G. Rogers, J. W. Pitman · The Annals of Probability · 325
1975 · James W. Pitman · Advances in Applied Probability · 285
1993 · Hans L. Bodlaender, Rolf H. Möhring · SIAM Journal on Discrete Mathematics · 207
2001 · Kevin Judd, Timothy McLain · AIAA Guidance, Navigation, and Control Conference and Exhibit · 122
1996 · Søren Asmussen, Claudia Klüppelberg · Stochastic Processes and their Applications · 122
2000 · Yuhong Zhu, G.N. Rouskas, et al. · IEEE/ACM Transactions on Networking · 117
1996 · L. Chaumont · Stochastic Processes and their Applications · 113
1983 · Michael Tarsi · Journal of Combinatorial Theory Series A · 112
2007 · Fedor V. Fomin, Serge Gaspers, et al. · Algorithmica · 110
1970 · David Williams · Bulletin of the American Mathematical Society · 109
2018 · Marek Cygan, Stefan Kratsch, et al. · Journal of the ACM · 101
2005 · Elena Prieto, Christian Sloper · Nordic journal of computing · 94
2006 · Steven N. Evans, Anita Winter · The Annals of Probability · 86
1984 · A.J.W Hilton · Journal of Combinatorial Theory Series B · 85
2007 · Vida Dujmović, Michael R. Fellows, et al. · Algorithmica · 84
1996 · L. Pyber · Journal of Combinatorial Theory Series B · 84
1991 · Hans L. Bodlaender, Ton Kloks · Lecture notes in computer science · 84
2012 · Tzvika Hartman, Avinatan Hassidim, et al. · IEEE Conference on Computer Communications (INFOCOM) · 72
2006 · Ashkan Nikeghbali, Marc Yor · Illinois Journal of Mathematics · 72
2013 · Marek Cygan, Stefan Kratsch, et al. · ACM Symposium on Theory of Computing (STOC) · 70
Works count: 721
Citation count: 9,472
Year
Topic
Type