Graphs, networks and algorithms
From MaRDI portal
Publication:883709
DOI10.1007/978-3-540-72780-4zbMath1126.68058OpenAlexW2058653097MaRDI QIDQ883709
Publication date: 8 June 2007
Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72780-4
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
Efficiency of the pMST and RDELA location and scatter estimators, Counting critical formations on the circle: algebraic-geometric and Morse-theoretic bounds, Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity, A global optimization algorithm for solving the minimum multiple ratio spanning tree problem, Passivity Based Attitude Control of Rigid Bodies, Towards an optimization theory for deforming dense granular materials: minimum cost maximum flow solutions, A bag-of-paths framework for network data analysis, Robust estimation of location and scatter by pruning the minimum spanning tree, Dynamic dispatching and repositioning policies for fast-response service networks, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, On finite-sample robustness of directional location estimators, Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion, Orbital diameters of the symmetric and alternating groups, Some remarks on segregation of \(k\) species in strongly competing systems, Constructing Armstrong tables for general cardinality constraints and not-null constraints, Inverse Shortest Path Models Based on Fundamental Cycle Bases, Parallel algorithms for the maximum flow problem with minimum lot sizes, A relation of dominance for the bicriterion bus routing problem, Long paths in hypercubes with a quadratic number of faults, Parameterized complexity of candidate control in elections and related digraph problems
