The following pages link to (Q4000231):
Displaying 50 items.
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- Online optimization of casualty processing in major incident response: an experimental analysis (Q322889) (← links)
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes (Q343754) (← links)
- Some certain properties of the generalized hypercubical functions (Q372454) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- A modified active set algorithm for transportation discrete network design bi-level problem (Q506465) (← links)
- Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks (Q513121) (← links)
- On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\) (Q666536) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Zeta functions of finite graphs and coverings. III (Q854111) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Tournament scoring problem (Q924403) (← links)
- A Bayesian approach to paired comparison rankings based on a graphical model (Q957108) (← links)
- A strict strong coloring of trees (Q989572) (← links)
- Data-based analysis of winner-loser models of hierarchy formation in animals (Q1026614) (← links)
- Cataloguing general graphs by point and line spectra (Q1125186) (← links)
- On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
- The Banzhaf power index on convex geometries (Q1296463) (← links)
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
- Bivariate chromatic polynomials in computer algebra (Q1733312) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- NETPAD: An interactive graphics system for network modeling and optimization (Q1904615) (← links)
- A graph isomorphism algorithm using pseudoinverses (Q1913583) (← links)
- Decision-making approaches based on color spectrum and D-TOPSIS method under rough environment (Q1983781) (← links)
- Preference graph of potential method as a fuzzy graph (Q2036514) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- Porous exponential domination in Harary graphs (Q2191954) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- On the complexity of reconstructing chemical reaction networks (Q2254073) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Effective fluctuation and response theory (Q2315164) (← links)
- A tight analysis of the submodular-supermodular procedure (Q2345618) (← links)
- A Jordan-Brouwer separation theorem for polyhedral pseudomanifolds (Q2391204) (← links)
- Goodness of fit for discrete random variables using the conditional density (Q2432634) (← links)
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem (Q2475838) (← links)
- Continuous-mode multiphoton filtering (Q2813313) (← links)
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs (Q3057177) (← links)
- Reciprocal of infinite series and partition functions (Q3092988) (← links)
- (Q3159164) (← links)
- Diagrams of Fuzzy Orderings (Q3164046) (← links)
- OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS (Q3511034) (← links)
- AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION (Q3596984) (← links)
- NOVEL PROPERTIES IN OXIDE HETEROSTRUCTURES (Q3636514) (← links)
- Universality of iterated networks (Q4311638) (← links)
- (Q5152618) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)
