Search results
From MaRDI portal
- Paper The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks 2007-11-28 Paper https://portal...10 bytes (17 words) - 21:51, 9 December 2023
- lattice networks through substructures 2019-08-14 Paper On \(\sigma\)-span and \(F\)-span of trees and full binary trees 2019-06-27 Paper https://portal.mardi4nfdi...10 bytes (18 words) - 00:53, 10 December 2023
- Navigating in a Graph by Aid of Its Spanning Tree Metric 2011-10-27 Paper Realizing disjoint degree sequences of span at most two: a tractable discrete tomography...10 bytes (16 words) - 20:15, 8 December 2023
- 2019-09-12 Paper Searching for realizations of finite metric spaces in tight spans 2018-10-18 Paper UPGMA and the normalized equidistant minimum evolution...10 bytes (16 words) - 01:37, 10 December 2023
- Diversities and the Geometry of Hypergraphs 2014-07-01 Paper Hyperconvexity and tight-span theory for diversities 2012-11-20 Paper `Bureaucratic' set systems, and...10 bytes (16 words) - 00:46, 12 December 2023
- 2022-10-13 Paper https://portal.mardi4nfdi.de/entity/Q5091054 2022-07-21 Paper A Tight Approximation for Submodular Maximization with Mixed Packing and Covering...10 bytes (17 words) - 05:11, 12 December 2023
- hardness of distributed approximation 2014-06-05 Paper Tight bounds for distributed minimum-weight spanning tree verification 2013-10-21 Paper Distributed Verification...10 bytes (16 words) - 12:41, 7 October 2023
- minimum size of tight hypergraphs 1992-10-05 Paper Extending kernel perfect digraphs to kernel perfect critical digraphs 1992-06-28 Paper Spanning trees with...10 bytes (19 words) - 23:37, 12 December 2023
- Satisfaction Problems Parameterized above or below Tight Bounds: A Survey 2012-09-05 Paper Arc-disjoint spanning sub(di)graphs in digraphs 2012-08-08 Paper Every...10 bytes (16 words) - 10:09, 8 December 2023
- Reconfiguration in Cographs 2015-09-09 Paper Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree 2014-09-09 Paper Reconfiguring Independent...10 bytes (17 words) - 19:23, 6 October 2023
- fixed-spin: efficient generation, ranking, and optimality 2023-03-09 Paper A Tight Upper Bound on the Average Order of Dominating Sets of a Graph 2022-08-22...10 bytes (16 words) - 01:14, 13 December 2023
- graphs of bounded genus and linklessly embeddable graphs 2020-01-29 Paper Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs...10 bytes (16 words) - 11:23, 8 December 2023
- 2004-10-01 Paper https://portal.mardi4nfdi.de/entity/Q4474212 2004-08-04 Paper Tight bound on Johnson's algorithm for maximum satisfiability 1999-11-09 Paper...10 bytes (18 words) - 21:56, 11 December 2023
- Min-Cut Linear Arrangement Problem on Trees 1982-01-01 Paper Asymptotically tight bounds on time-space trade-offs in a pebble game 1982-01-01 Paper Black-white...10 bytes (17 words) - 00:01, 12 December 2023
- asymptotic result 2023-10-09 Paper Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result 2023-10-09 Paper Antipaths...10 bytes (19 words) - 22:59, 9 December 2023
- Date of Publication Type Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments 2023-05-23 Paper Tight Bounds for Online TSP on the Line...10 bytes (16 words) - 21:35, 24 September 2023
- 2023-08-22 Paper Two completely independent spanning trees of \(P_4\)-free graphs 2023-04-24 Paper Laminar tight cuts in matching covered graphs 2021-07-06...10 bytes (16 words) - 16:11, 10 December 2023
- graphs into isomorphic linear forests 2022-10-20 Paper The Tur\'an density of tight cycles in three-uniform hypergraphs 2022-09-16 Paper Chi-boundedness of graphs...10 bytes (16 words) - 02:06, 11 December 2023
- algorithm for weighted paired-domination on block graphs 2022-08-26 Paper Tight approximation for partial vertex cover with hard capacities 2020-11-25 Paper...10 bytes (18 words) - 09:17, 25 September 2023
- problems with inexact partial information 2007-12-10 Paper Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values 2007-10-26...10 bytes (16 words) - 14:20, 8 December 2023
