Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Sunghyun Lee, Kiyoung Choi, Sungjoo Yoo |
An intra-task dynamic voltage scaling method for SoC design with hierarchical FSM and synchronous dataflow model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2002 International Symposium on Low Power Electronics and Design, 2002, Monterey, California, USA, August 12-14, 2002, pp. 84-87, 2002, ACM, 1-58113-475-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
variable supply voltage, low power, finite state machine, dynamic voltage scaling, formal model, synchronous dataflow |
16 | John Markus Bjørndalen, Otto J. Anshus, Tore Larsen, Lars Ailo Bongo, Brian Vinter |
Scalable Processing and Communication Performance in a Multi-Media Related Context. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 28th EUROMICRO Conference 2002, 4-6 September 2002, Dortmund, Germany, pp. 200-206, 2002, IEEE Computer Society, 0-7695-1787-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | David M. Harris, Sam Naffziger |
Statistical clock skew modeling with data delay variations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 9(6), pp. 888-898, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Arun Krishnamachary, Jacob A. Abraham, Raghuram S. Tupuri |
Timing Verification and Delay Test Generation for Hierarchical Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 14th International Conference on VLSI Design (VLSI Design 2001), 3-7 January 2001, Bangalore, India, pp. 157-162, 2001, IEEE Computer Society, 0-7695-0831-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Luciano Margara, Janos Simon |
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 768-779, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano |
Randomized path coloring on binary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 60-71, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Savithri Sundareswaran, David T. Blaauw, Abhijit Dharchoudhury |
A Three-Tier Assertion Technique for Spice Verification of Transistor Level Timing Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 12th International Conference on VLSI Design (VLSI Design 1999), 10-13 January 1999, Goa, India, pp. 175-180, 1999, IEEE Computer Society, 0-7695-0013-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
spice verification, primary-path, secondary-path, timing analysis, assertion, assertibility |
16 | Luisa Gargano |
Limited Wavelength Conversion in All-Optical Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 544-555, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Katzalin Olcoz, Francisco Tirado |
Register Allocation with Simultaneous BIST Intrusio. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 24th EUROMICRO '98 Conference, Engineering Systems and Software for the Next Decade, 25-27 August 1998, Vesteras, Sweden, pp. 10099-10106, 1998, IEEE Computer Society, 0-8186-8646-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Jeffrey X. Su, David L. Dill, Jens U. Skakkebæk |
Formally Verifying Data and Control with Weak Reachability Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, Second International Conference, FMCAD '98, Palo Alto, California, USA, November 4-6, 1998, Proceedings, pp. 387-402, 1998, Springer, 3-540-65191-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Yau-Tsun Steven Li, Sharad Malik |
Performance analysis of embedded software using implicit path enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(12), pp. 1477-1487, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Rajiv Gupta 0001, David A. Berson, Jesse Zhixi Fang |
Path Profile Guided Partial Dead Code Elimation Using Predication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1997 Conference on Parallel Architectures and Compilation Techniques (PACT '97), San Francisco, CA, USA, October 11-15, 1997, pp. 102-, 1997, IEEE Computer Society, 0-8186-8090-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Pramod V. Koppol, Kuo-Chung Tai |
An Incremental Approach to Structural Testing of Concurrent Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the 1996 International Symposium on Software Testing and Analysis, ISSTA 1996, San Diego, CA, USA, January 8-10, 1996, pp. 14-23, 1996, ACM, 0-89791-787-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Yau-Tsun Steven Li, Sharad Malik |
Performance Analysis of Embedded Software Using Implicit Path Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Languages, Compilers, & Tools for Real-Time Systems ![In: Proceedings of the ACM SIGPLAN 1995 Workshop on Languages, Compilers, & Tools for Real-Time Systems (LCT-RTS 1995). La Jolla, California, USA, June 21-22, 1995, pp. 88-98, 1995, ACM. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Friedhelm Meyer auf der Heide, Berthold Vöcking |
A Packet Routing Protocol for Arbitrary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 291-302, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Jochen Behrens, J. J. Garcia-Luna-Aceves |
Distributed, Scalable Routing Based on Link-State Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, London, UK, August 31 - September 2, 1994, pp. 136-147, 1994, ACM, 0-89791-682-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Jeffrey D. Ullman, Mihalis Yannakakis |
The Input/Output Complexity of Transitive Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, USA, May 23-25, 1990., pp. 44-53, 1990, ACM Press, 978-0-89791-365-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Barry K. Rosen |
Monoids for Rapid Data Flow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pp. 47-59, 1978, ACM Press. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
16 | Mengjie Lv, Jianxi Fan, Baolei Cheng, Jia Yu 0005, Xiaohua Jia |
Construction algorithms of fault-tolerant paths and disjoint paths in k-ary n-cube networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 183, pp. 104761, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Konstantin Sidorov, Gonçalo Homem De Almeida Correia, Mathijs de Weerdt, Emir Demirovic |
Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 20794-20802, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Gökçe Çaylak Kayaturan, Gökhan Özçelik, Aytül Gökçe |
Decision-aided evaluation of paths for routing on multi-attribute computer network consisting of encoded paths under uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 223, pp. 119881, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Shiri Chechik, Tianyi Zhang 0008 |
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 87-99, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Melissa D. Clarkson, Landon Detwiler |
OWL Paths: A library for processing SPARQL-like property paths over OWL classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOP@ISWC ![In: Proceedings of the 14th Workshop on Ontology Design and Patterns (WOP 2023) co-located with the 22nd International Semantic Web Conference (ISWC 2023), Athens, Greece, November 06, 2023., pp. 13-18, 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Marie Destandau, Caroline Appert, Emmanuel Pietriga |
S-Paths: Set-based visual exploration of linked data driven by semantic paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Semantic Web ![In: Semantic Web 12(1), pp. 99-116, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Alberto Bartoli |
Robustness analysis of DNS paths and web access paths in public administration websites. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Commun. ![In: Comput. Commun. 180, pp. 243-258, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Yefim Dinitz, Shlomi Dolev, Manish Kumar 0011 |
Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.11514, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Jia-Xiang Tang, Shih-Hsu Huang, Jui-Hung Hung |
ECO Timing Optimization with Data Paths and Clock Paths Considered. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPACS ![In: International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2021, Hualien City, Taiwan, November 16-19, 2021, pp. 1-2, 2021, IEEE, 978-1-6654-1951-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Lin Yang, Sheng-Liang Yang |
A Relation Between Schröder Paths and Motzkin Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(5), pp. 1489-1502, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Satoshi Naito, Fumihiko Nomoto, Daisuke Sagaki |
Tensor product decomposition theorem for quantum Lakshmibai-Seshadri paths and standard monomial theory for semi-infinite Lakshmibai-Seshadri paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 169, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt |
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 22(1), pp. 59-68, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan |
Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. ICA ![In: Bull. ICA 83, pp. 29-51, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Koki Washio, Tsuneaki Kato |
Filling Missing Paths: Modeling Co-occurrences of Word Pairs and Dependency Paths for Recognizing Lexical Semantic Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.03411, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Koki Washio, Tsuneaki Kato |
Filling Missing Paths: Modeling Co-occurrences of Word Pairs and Dependency Paths for Recognizing Lexical Semantic Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAACL-HLT ![In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2018, New Orleans, Louisiana, USA, June 1-6, 2018, Volume 1 (Long Papers), pp. 1123-1133, 2018, Association for Computational Linguistics, 978-1-948087-27-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Wehmuth, Artur Ziviani |
Avoiding Spurious Paths in Centralities Based on Shortest Paths in High Order Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LADC ![In: 8th Latin-American Symposium on Dependable Computing, LADC 2018, Foz do Iguaçu, Brazil, October 8-10, 2018, pp. 19-26, 2018, IEEE, 978-1-5386-8489-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Benjamin Momège |
Simple Paths and Cycles Avoiding Forbidden Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings, pp. 285-294, 2018, Springer, 978-3-319-73116-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Susan Khor |
Comparing local search paths with global search paths on protein residue networks: allosteric communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex Networks ![In: J. Complex Networks 5(3), pp. 409-432, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Jin Dai, Yebin Wang, Scott A. Bortoff, Daniel J. Burns |
From reeds-shepp's paths to continuous curvature paths-Part I: Transition schemes & algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCTA ![In: IEEE Conference on Control Technology and Applications, CCTA 2017, Mauna Lani Resort, HI, USA, August 27-30, 2017, pp. 355-362, 2017, IEEE, 978-1-5090-2182-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Keigo Matsumoto, Takuji Narumi, Yuki Ban, Tomohiro Tanikawa, Michitaka Hirose |
Turn physically curved paths into virtual curved paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VR ![In: 2017 IEEE Virtual Reality, VR 2017, Los Angeles, CA, USA, March 18-22, 2017, pp. 247-248, 2017, IEEE Computer Society, 978-1-5090-6647-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Romain Aïssat, Frédéric Voisin, Burkhart Wolff |
Infeasible Paths Elimination by Symbolic Execution Techniques: Proof of Correctness and Preservation of Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2016, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
16 | Sara Comai, Emanuele De Bernardi, Matteo Matteucci, Fabio Salice |
Maps for Easy Paths (MEP): Enriching Maps with Accessible Paths Using MEP Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GOODTECHS ![In: Smart Objects and Technologies for Social Good - Second International Conference, GOODTECHS 2016, Venice, Italy, November 30 - December 1, 2016, Proceedings, pp. 254-263, 2016, Springer, 978-3-319-61948-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
16 | Romain Aïssat, Frédéric Voisin, Burkhart Wolff |
Infeasible Paths Elimination by Symbolic Execution Techniques - Proof of Correctness and Preservation of Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings, pp. 36-51, 2016, Springer, 978-3-319-43143-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
16 | Sarah Wassermann, Pedro Casas, Benoit Donnet, Guy Leduc, Marco Mellia |
On the Analysis of Internet Paths with DisNETPerf, a Distributed Paths Performance Analyzer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN Workshops ![In: 41st IEEE Conference on Local Computer Networks Workshops, LCN Workshops 2016, Dubai, United Arab Emirates, November 7-10, 2016, pp. 72-79, 2016, IEEE Computer Society, 978-1-5090-2347-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
16 | Stefano Capparelli, Alberto Del Fra |
Dyck Paths, Motzkin Paths, and the Binomial Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Integer Seq. ![In: J. Integer Seq. 18(8), pp. 15.8.5, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
16 | Chia-Wei Lee, Pin-Liang Chen, Sun-Yuan Hsieh |
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 180, pp. 126-134, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
16 | Rosena R. X. Du, Yingying Nie, Xuezhi Sun |
Enumerations of humps and peaks in (k, a)-paths and (n, m)-Dyck paths via bijective proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 190-191, pp. 42-49, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
16 | Shinsuke Odagiri, Hiroyuki Goto |
On the Greatest Number of Paths and Maximal Paths for a Class of Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6), pp. 1370-1374, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Tong-Wook Shinn, Tadao Takaoka |
Combining the Shortest Paths and the Bottleneck Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSC ![In: Thirty-Seventh Australasian Computer Science Conference, ACSC 2014, Auckland, New Zealand, January 2014, pp. 13-18, 2014, Australian Computer Society, 978-1-921770-30-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Tong-Wook Shinn, Tadao Takaoka |
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pp. 226-237, 2014, Springer, 978-3-642-54422-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Tong-Wook Shinn, Tadao Takaoka |
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.5687, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Tong-Wook Shinn, Tadao Takaoka |
Combining the Shortest Paths and the Bottleneck Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.5081, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Zbigniew R. Bogdanowicz |
On Properties of Working Paths in Optimal Set of Survivable Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 109, pp. 361-370, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 62(2), pp. 161-163, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Wen-Pin Tu, Shih-Hsu Huang, Chun-Hua Cheng |
Co-synthesis of data paths and clock control paths for minimum-period clock gating. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation and Test in Europe, DATE 13, Grenoble, France, March 18-22, 2013, pp. 1831-1836, 2013, EDA Consortium San Jose, CA, USA / ACM DL, 978-1-4503-2153-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Dimitri Papadimitriou, Davide Careglio, Fabien Tarissan, Piet Demeester |
Internet routing paths stability model and relation to forwarding paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DRCN ![In: 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013, Budapest, Hungary, March 4-7, 2013, pp. 20-27, 2013, IEEE, 978-1-4799-0049-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Liam Roditty, Uri Zwick |
Replacement paths and k simple shortest paths in unweighted directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 8(4), pp. 33:1-33:11, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Serge Gaspers |
From edge-disjoint paths to independent paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.4483, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Bixin Li, Lulu Wang 0001, Hareton Leung, Fei Liu 0019 |
Profiling all paths: A new profiling technique for both cyclic and acyclic paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Softw. ![In: J. Syst. Softw. 85(7), pp. 1558-1576, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Marcin Kaminski 0001, Paul Medvedev, Martin Milanic |
Shortest paths between shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(39), pp. 5205-5210, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Salam N. Salloum, Lei Liu |
Algorithms for Generating a Minimum Set of Paths for all Du-Paths Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEDE ![In: ISCA 20th International Conference on Software Engineering and Data Engineering (SEDE-2011) June 20-22, 2011, Imperial Palace Hotel, Las Vegas, Nevada USA, pp. 65-68, 2011, ISCA, 978-1-880843-82-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang |
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 76(8), pp. 697-708, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Marcin Kaminski 0001, Paul Medvedev, Martin Milanic |
Shortest paths between shortest paths and independent sets ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.4563, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Aaron Bernstein |
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 742-755, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Marcin Kaminski 0001, Paul Medvedev, Martin Milanic |
Shortest Paths between Shortest Paths and Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, pp. 56-67, 2010, Springer, 978-3-642-19221-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Zvi Gotthilf, Moshe Lewenstein |
Improved algorithms for the k simple shortest paths and the replacement paths problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(7), pp. 352-355, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Shinji Inoue, Jun Shimaichi, Yoshiaki Kakuda |
An autonomous method for aggregating primary paths and reserving backup paths in sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISADS ![In: International Symposium on Autonomous Decentralized Systems (ISADS 2009), 23-25 March 2009, Athens, Greece, pp. 351-356, 2009, IEEE Computer Society, 978-1-4244-4327-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Thomas Edison Yu, Tomokazu Yoneda, Satoshi Ohtake, Hideo Fujiwara |
Identifying Non-Robust Untestable RTL Paths in Circuits with Multi-cycle Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATS ![In: 17th IEEE Asian Test Symposium, ATS 2008, Sapporo, Japan, November 24-27, 2008, pp. 125-130, 2008, IEEE Computer Society, 978-0-7695-3396-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | C. C. Jane |
A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance (Yeh, 2005). ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 58(10), pp. 1394, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | John Hogden, Philip Rubin, Erik McDermott, Shigeru Katagiri, Louis Goldstein |
Inverting mappings from smooth paths through Rn to paths through Rm: A technique applied to recovering articulation from acoustics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Speech Commun. ![In: Speech Commun. 49(5), pp. 361-383, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Andreas Bley |
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 50(1), pp. 29-36, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Xingxing Yu |
Infinite paths in planar graphs III, 1-way infinite paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 51(3), pp. 175-198, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Paul Dorbec, Michel Mollard |
Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 12, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | W.-C. Yeh |
A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 56(10), pp. 1235-1240, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Midori Kobayashi, Gisaku Nakamura, Chie Nara |
Uniform coverings of 2-paths with 5-paths in the complete graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 299(1-3), pp. 154-161, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Arthur W. Chou, Ker-I Ko |
On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004, pp. 45-57, 2004, Elsevier. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Arthur W. Chou, Ker-I Ko |
On the complexity of finding paths in a two-dimensional domain I: Shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 50(6), pp. 551-572, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | J. W. McGee, Christopher A. Rodger |
Embedding coverings of 2-paths with 3-paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 284(1-3), pp. 217-223, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Richard Brak, John W. Essam |
Bicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 10, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Midori Kobayashi, Gisaku Nakamura, Chie Nara |
Uniform coverings of 2-paths with 5-paths in K2n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 27, pp. 247-252, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
16 | Midori Kobayashi, Gisaku Nakamura |
Uniform coverings of 2-paths by 4-paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 24, pp. 301-304, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
16 | Richard Furuta, Frank M. Shipman III, Luis Francisco-Revilla, Hao-wei Hsieh, Unmil Karadkar, Shueh-Cheng Hu |
Ephemeral Paths on the WWW: The Walden's Paths Lightweight Path Mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WebNet ![In: Proceedings of WebNet 99 - World Conference on the WWW and Internet, Honolulu, Hawaii, USA, October 24-30, 1999, pp. 409-414, 1999, AACE, 1-880094-36-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
16 | Andrei M. Shkel, Vladimir J. Lumelsky |
On calculation of optimal paths with constrained curvature: the case of long paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: Proceedings of the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, April 22-28, 1996, pp. 3578-3583, 1996, IEEE, 0-7803-2988-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi |
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 61(1), pp. 21-43, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Alexander V. Karzanov |
Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 60(1), pp. 19-35, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Haruko Okamura |
Paths and edge-connectivity in graphs III. Six-terminalk paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 3(1), pp. 159-189, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
16 | Mark E. Watkins |
Infinite paths that contain only shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 41(3), pp. 341-355, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
16 | Rafic Z. Makki, C. Tiansheng |
Designing Testable Control Paths with Multiple and Feedback Scan-Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Proceedings International Test Conference 1986, Washington, D.C., USA, September 1986, pp. 484-492, 1986, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP BibTeX RDF |
|
15 | Francesc Castro, Esteve del Acebo, Mateu Sbert |
Heuristic-Search-Based Light Positioning According to Irradiance Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Smart Graphics ![In: Smart Graphics, 9th International Symposium, SG 2009, Salamanca, Spain, May 28-30, 2009. Proceedings, pp. 128-139, 2009, Springer, 978-3-642-02114-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Light positioning, reuse of paths, random walk, heuristic search, irradiance |
15 | Aaron Bernstein, David R. Karger |
A nearly optimal oracle for avoiding failed vertices and edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 101-110, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
shortest paths, sensitivity |
15 | Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe |
Terracost: Computing least-cost-path surfaces for massive grid terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.9:1-1.9:31, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
terrain data, shortest paths, Dijkstra's algorithm, I/O-efficiency, Data structures and algorithms |
15 | Nicolas Beldiceanu, Pierre Flener, Xavier Lorca |
Combining Tree Partitioning, Precedence, and Incomparability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 13(4), pp. 459-489, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem |
15 | Frank Kammer, Torsten Tholey |
The Complexity of Minimum Convex Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 16-27, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Convex Coloring, Maximum Disjoint Paths Problem |
15 | Xiang Bai, Xingwei Yang, Longin Jan Latecki, Yanbo Xu, Wenyu Liu 0001 |
Computing Stable Skeletons with Particle Filters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings, pp. 30-41, 2008, Springer, 978-3-540-89196-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
skeletal paths, Skeleton, shape, particle filters, pruning |
15 | David Eppstein, Michael T. Goodrich |
Studying (non-planar) road networks through an algorithmic lens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, pp. 16, 2008, ACM, 978-1-60558-323-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
algorithmic lens, circle arrangements, disk neighborhood systems, multiscale-dispersed graphs, shortest paths, Voronoi diagrams, road networks |
15 | Jirí Vábek, Daniel Joscák, Milan Bohácek, Jirí Tuma |
A New Type of 2-Block Collisions in MD5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2008, 9th International Conference on Cryptology in India, Kharagpur, India, December 14-17, 2008. Proceedings, pp. 78-90, 2008, Springer, 978-3-540-89753-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Stevens algorithm, collisions, MD5, differential paths |
15 | Saeedeh Bakhshi, Hamid Sarbazi-Azad |
One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 227-232, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multi-computers, WK-recursive, Parallel routing, interconnection networks, node-disjoint paths |
15 | Pavlo A. Krokhmal, Stan Uryasev |
A sample-path approach to optimal position liquidation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 152(1), pp. 193-225, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Optimal trading, Market impact, Stochastic programming, Sample paths |
15 | Hsiang-Yang Chen, Ting-Wei Hou, Chun-Liang Lin |
Tamper-proofing basis path by using oblivious hashing on Java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 42(2), pp. 9-16, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
basis paths, oblivious hashing, Java, Java, tamper-proofing |
15 | Smita Rai, Omkar Deshpande, Canhui Ou, Charles U. Martel, Biswanath Mukherjee |
Reliable multipath provisioning for high-capacity backbone mesh networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(4), pp. 803-812, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
degraded service, effective multipath bandwidth, flexible provisioning, multiconstrained paths, multipath provisioning, virtual concatenation (VCAT) |
15 | Mohamed Shehab, Kamal Bhattacharya, Arif Ghafoor |
Web services discovery in secure collaboration environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Internet Techn. ![In: ACM Trans. Internet Techn. 8(1), pp. 5, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Secure collaboration, encapsulated SOAP, private UDDI registries, secure access paths, protocols, services |
15 | Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh |
Hamiltonicity of hypercubes with a constraint of required and faulty edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 197-204, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hamiltonian cycles and paths, Edge-fault-tolerance, Required edge, Hypercubes |