October 11, 2017 article Open access A characterization of linearizable instances of the quadratic minimum spanning tree problem Journal of Combinatorial Optimization DOI: 10.1007/s10878-017-0184-3 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 23 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access A linear time algorithm for linearizing quadratic and higher-order shortest path problems 2024 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access 2 citations A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems 2023 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 4 citations Linearizable Special Cases of the Quadratic Shortest Path Problem 2021 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs 3 citations 3 results References 0