Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Richard S. Bird |
Loopless Functional Algorithms. |
MPC |
2006 |
DBLP DOI BibTeX RDF |
|
89 | James F. Korsh, Paul LaFollette |
Loopless Generation of Linear Extensions of a Poset. |
Order |
2002 |
DBLP DOI BibTeX RDF |
loopless algorithm, poset, linear extension, topological sort |
89 | Limin Xiang, Kazuo Ushijima, Yuichi Asahiro |
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. |
ITCC |
2002 |
DBLP DOI BibTeX RDF |
coding $k$-ary trees, loopless generation, lexicographic order |
89 | Paul LaFollette, James F. Korsh |
A Loopless Algorithm for Generation of Basic Minimal Interval Orders. |
Order |
2000 |
DBLP DOI BibTeX RDF |
loopless algorithm, minimal, interval order |
79 | Doohee Nam, Seongil Shin, Changho Choi, Yongtaek Lim, Seung Jae Lee |
An Algorithm for Loopless Optimum Paths Finding Agent System and Its Application to Multimodal Public Transit Network. |
KES-AMSTA |
2007 |
DBLP DOI BibTeX RDF |
optimum path agent, Loopless path, Looping path, Network Transform, Mode-Link Transformation, Link Loopless path, K shortest Path |
75 | Koichiro Doi, Jing Li 0002, Tao Jiang 0001 |
Minimum Recombiant Haplotype Configuration on Tree Pedigrees. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
70 | James F. Korsh, Paul LaFollette |
A loopless Gray code for rooted trees. |
ACM Trans. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Loopless, Gray code, rooted trees |
70 | Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal |
A new implementation of Yen's ranking loopless paths algorithm. |
4OR |
2003 |
DBLP DOI BibTeX RDF |
loopless path, paths ranking, network, path |
62 | Aaron Williams |
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Gurmeet Singh Manku, Joe Sawada |
A Loopless Gray Code for Minimal Signed-Binary Representations. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Gideon Ehrlich |
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations. |
J. ACM |
1973 |
DBLP DOI BibTeX RDF |
|
37 | Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey |
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Richard S. Bird |
Spider Spinning for Dummies. |
Advanced Functional Programming |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco |
A comprehensive survey on the quickest path problem. |
Ann. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
Bicriteria problem, Minsum-maxmin, Quickest path, Paths ranking |
37 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Michael M. Weigand |
Algorithmus 20 Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen. |
Computing |
1974 |
DBLP DOI BibTeX RDF |
|
25 | Pedro A. Saa, Sebastian Zapararte, Christopher C. Drovandi, Lars K. Nielsen |
LooplessFluxSampler: an efficient toolbox for sampling the loopless flux solution space of metabolic models. |
BMC Bioinform. |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Boao Kong, Shuchen Zhu, Songtao Lu, Xinmeng Huang, Kun Yuan |
Decentralized Bilevel Optimization over Graphs: Loopless Algorithmic Update and Transient Iteration Complexity. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Yury Demidovich, Grigory Malinovsky, Peter Richtárik |
Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Jean Néraud |
Loopless algorithms to generate maximum length gray cycles wrt. k-character substitutions. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Nikita Fedin, Eduard Gorbunov |
Byzantine-Robust Loopless Stochastic Variance-Reduced Gradient. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Jean Néraud |
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Youcheng Niu, Ying Sun 0003, Yan Huang, Jinming Xu 0002 |
A Loopless Distributed Algorithm for Personalized Bilevel Optimization. |
CDC |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Yuanyuan Liu 0001, Jiacheng Geng, Fanhua Shang, Weixin An, Hongying Liu, Qi Zhu |
Loopless Variance Reduced Stochastic ADMM for Equality Constrained Problems in IoT Applications. |
IEEE Internet Things J. |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Matilde Gargiani, Andrea Zanelli, Andrea Martinelli, Tyler H. Summers, John Lygeros |
PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
25 | Massimiliano Lucci, Valerio Campanari, Davide Cassi, Vittorio Merlo, Francesco Romeo, Gaetano Salina, Matteo Cirillo |
Quantum Coherence in Loopless Superconductive Networks. |
Entropy |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Julian von Tschammer, Robert Mattmüller, David Speck 0001 |
Loopless Top-K Planning. |
ICAPS |
2022 |
DBLP BibTeX RDF |
|
25 | Matilde Gargiani, Andrea Zanelli, Andrea Martinelli, Tyler H. Summers, John Lygeros |
PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation. |
ICML |
2022 |
DBLP BibTeX RDF |
|
25 | Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang |
A loopless algorithm for generating (k, m)-ary trees in Gray code order. |
Optim. Lett. |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Zhize Li |
ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
25 | Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang |
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order. |
FAW |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Xiangyang Liu, Bingkun Wei, Fanhua Shang, Hongying Liu |
Loopless Semi-Stochastic Gradient Descent with Less Hard Thresholding for Sparse Learning. |
CIKM |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray code enumeration and the Tower of Bucharest. |
Theor. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Siu Hung Joshua Chan, Lin Wang 0031, Satyakam Dash, Costas D. Maranas |
Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints. |
Bioinform. |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Pedro A. Saa, Lars Keld Nielsen |
Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models. |
Bioinform. |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray Code Enumeration and the Tower of Bucharest. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
25 | Cassio Neri |
A loopless and branchless $O(1)$ algorithm to generate the next Dyck word. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray Code Enumeration and the Tower of Bucharest. |
FUN |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai |
A loopless algorithm for generating multiple binary tree sequences simultaneously. |
Theor. Comput. Sci. |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Shude Long, Junliang Cai |
Enumeration of rooted loopless unicursal planar maps. |
Ars Comb. |
2014 |
DBLP BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai |
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. |
COCOA |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Amin Ahmadi-Adl, Abbas Nowzari-Dalini, Hayedeh Ahrabian |
Ranking and unranking algorithms for loopless generation of t-ary trees. |
Log. J. IGPL |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams |
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang |
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. |
Comput. J. |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Toufik Mansour, Ghalib Nassar |
Gray Codes, Loopless Algorithm and Partitions. |
J. Math. Model. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Tadao Takaoka, Stephen Violich |
Fusing Loopless Algorithms for Combinatorial Generation. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Olivier Bernardi |
Bijective counting of Kreweras walks and loopless triangulations. |
J. Comb. Theory, Ser. A |
2007 |
DBLP DOI BibTeX RDF |
|
25 | H. Bricard |
An adaptation of Eppstein's algorithm dealing with the k shortest - loopless and having at most p arcs - paths problem. |
Electron. Notes Discret. Math. |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Tadao Takaoka, Stephen Violich |
Combinatorial Generation by Fusing Loopless Algorithms. |
CATS |
2006 |
DBLP BibTeX RDF |
|
25 | Valery A. Liskovets, Timothy R. S. Walsh |
Counting unrooted loopless planar maps. |
Eur. J. Comb. |
2005 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Array Generation of Multiset Permutations. |
Comput. J. |
2004 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette, Seymour Lipschutz |
Loopless Algorithms and Schröder Trees. |
Int. J. Comput. Math. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
A loopless algorithm for generating the permutations of a multiset. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Schröder Trees. |
Comput. J. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Han Ren, Yanpei Liu, Zhaoxiang Li |
Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Trees with Specified Degrees. |
Comput. J. |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Han Ren, Yanpei Liu |
The Number of Loopless 4-Regular Maps on the Projective Plane. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Jason P. Jue |
An algorithm for loopless deflection in photonic packet-switched networks. |
ICC |
2002 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh |
Loopless generation of up-down permutations. |
Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
A Loopless Generation of Bitstrings without p Consecutive Ones. |
DMTCS |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Limin Xiang, Kazuo Ushijima, Changjie Tang |
Efficient loopless generation of Gray codes for k-ary trees. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Dominique Roelants van Baronaigien |
A Loopless Gray-Code Algorithm for Listing k-ary Trees. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Gray Codes for k-Ary Trees. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Seymour Lipschutz |
Shifts and Loopless Generation of k-Ary Trees. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
On the Loopless Generation of Binary Tree Sequences. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh |
Loopless Generation of k-Ary Tree Sequences. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Dominique Roelants van Baronaigien |
A Loopless Algorithm for Generating Binary Tree Sequences. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
25 | M. C. Er |
A loopless and optimal algorithm for the cyclic towers of hanoi problem. |
Inf. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
25 | Aarni Perko |
Implementation of algorithms for K shortest loopless paths. |
Networks |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Edward A. Bender, Nicholas C. Wormald |
The number of loopless planar maps. |
Discret. Math. |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Hiroshi Nagamochi |
A Detachment Algorithm for Inferring a Graph from Path Frequency. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Detachment algorithm, Graph inference, Connectivity, Multigraphs |
19 | John Hershberger 0001, Matthew Maxel, Subhash Suri |
Finding the k shortest simple paths: A new algorithm and its implementation. |
ACM Trans. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Loop-free paths, directed paths, path equivalence class, replacement paths |
19 | Hiroshi Nagamochi |
A Detachment Algorithm for Inferring a Graph from Path Frequency. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Zifei Zhong, Ram Keralapura, Srihari Nelakuditi, Yinzhe Yu, Junling Wang, Chen-Nee Chuah, Sanghwan Lee |
Avoiding Transient Loops Through Interface-Specific Forwarding. |
IWQoS |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Frank Ruskey, Aaron Williams |
Generating Combinations by Prefix Shifts. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Daniel Sawitzki |
A Symbolic Approach to the All-Pairs Shortest-Paths Problem. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Talal Ali Al-Hawary, D. George McRae |
Toward an Elementary Axiomatic Theory of the Category of LP-Matroids. |
Appl. Categorical Struct. |
2003 |
DBLP DOI BibTeX RDF |
strong map, category, matroid |
19 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
(H, C, K)-Coloring: Fast, Easy, and Hard Cases. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Romeo Rizzi |
NOTE - On Minimizing Symmetric Set Functions. |
Comb. |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85 |
19 | Donna Ghosh, Venkatesh Sarangan, Raj Acharya |
Distributed Quality of Service Routing. |
HiPC |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Erich Prisner |
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Michael M. Weigand |
Algorithmus 27 Ein neuer Algorithmus zur Bestimmung vonk-kürzesten Wegen in einem Graphen. |
Computing |
1976 |
DBLP DOI BibTeX RDF |
|