scientific article
From MaRDI portal
Publication:4000231
zbMath0786.05004MaRDI QIDQ4000231
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
An estimate of the objective function optimum for the network Steiner problem, Diagrams of Fuzzy Orderings, Online optimization of casualty processing in major incident response: an experimental analysis, Zeta functions of finite graphs and coverings. III, NETPAD: An interactive graphics system for network modeling and optimization, A graph-based algorithm for the multi-objective optimization of gene regulatory networks, A Jordan-Brouwer separation theorem for polyhedral pseudomanifolds, Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes, A graph isomorphism algorithm using pseudoinverses, Some certain properties of the generalized hypercubical functions, Cataloguing general graphs by point and line spectra, Universality of iterated networks, Porous exponential domination in Harary graphs, Monitoring edge-geodetic sets in graphs, OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS, Methods for determining cycles of a specific length in undirected graphs with edge weights, Effective Computation of a Feedback Arc Set Using PageRank, A computational approach to construct a multivariate complete graph invariant, Graph measures with high discrimination power revisited: a random polynomial approach, Goodness of fit for discrete random variables using the conditional density, Pattern matching with address errors: rearrangement distances, Tournament scoring problem, The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks, Restrained domination in self-complementary graphs, Bivariate chromatic polynomials in computer algebra, On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\), Decision-making approaches based on color spectrum and D-TOPSIS method under rough environment, A modified active set algorithm for transportation discrete network design bi-level problem, Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks, A Bayesian approach to paired comparison rankings based on a graphical model, Expected runtimes of evolutionary algorithms for the Eulerian cycle problem, On the complexity of reconstructing chemical reaction networks, On the maximum edge-pair embedding bipartite matching, AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION, A strict strong coloring of trees, Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs, On efficient network similarity measures, Preference graph of potential method as a fuzzy graph, Open problems on graph eigenvalues studied with AutoGraphiX, Continuous-Mode MultiPhoton Filtering, NOVEL PROPERTIES IN OXIDE HETEROSTRUCTURES, Reciprocal of infinite series and partition functions, On the spectra of certain graphs arising from finite fields, Data-based analysis of winner-loser models of hierarchy formation in animals, Effective fluctuation and response theory, Connectivity of workflow nets: The foundations of stepwise verification, The Banzhaf power index on convex geometries, Unnamed Item, On the maxima of Motzkin-Straus programs and cliques of graphs, Computers and discovery in algebraic graph theory, A tight analysis of the submodular-supermodular procedure
Uses Software
