The following pages link to (Q5523467):
Displaying 50 items.
- Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems (Q758935) (← links)
- A new algorithm for solving the tree isomorphism problem (Q787675) (← links)
- Frustration and overblocking on graphs (Q967970) (← links)
- Generic properties of column-structured matrices (Q1057344) (← links)
- On methods for generating random partial orders (Q1085055) (← links)
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- Sensitivitätsindices für Knoten und Kanten eines Netzes (Q1144482) (← links)
- Optimal scaling for arbitrarily ordered categories (Q1149715) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Weighted min cost flows (Q1168883) (← links)
- Constructing a stochastic critical path network given the slacks: Representation (Q1196917) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Vector spaces and the four-color problem (Q1212001) (← links)
- Properties of a planar cubic graph (Q1214431) (← links)
- Algorithm for deriving the chromatic polynomial of a graph (Q1215637) (← links)
- Some applications of graph theory to clustering (Q1222008) (← links)
- The number of two-way tables satisfying certain additivity axioms (Q1224405) (← links)
- An introduction to matching polynomials (Q1229232) (← links)
- Properties of a Euler graph (Q1231500) (← links)
- Decentralized control of linear multivariable systems (Q1234269) (← links)
- A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them (Q1244052) (← links)
- On ''The tantalizer'' and ''Instant insanity'' (Q1244253) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- General equilibrium and the theory of directed graphs (Q1361904) (← links)
- Stochastic token theory (Q1368382) (← links)
- Arbitrarily traceable graphs and digraphs (Q1394358) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Finding all the negative cycles in a directed graph (Q1602697) (← links)
- A QoS multicast routing protocol for dynamic group topology (Q1763928) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Methods for calculating zero-level instability of electronic circuits under variations in parameters and external disturbances (Q2243772) (← links)
- Algorithm of the method of generalized potentials for problems of the optimum synthesis of communication networks with undefined factors (Q2287405) (← links)
- Algorithm of the generalized method of potentials for the problem of optimal linear synthesis of a communication network (Q2290835) (← links)
- Dimension of the Gibbs function topological manifold. I: Graph representation of the thermodynamic equilibrium state (Q2353519) (← links)
- Application of the majority connectedness carrier for computing the reliability of complex systems (Q2371633) (← links)
- The graph isomorphism problem and approximate categories (Q2437326) (← links)
- Planning temporal events using point-interval logic (Q2473196) (← links)
- Decomposition of communication networks (Q2524160) (← links)
- A prediction theory for some nonlinear functional-differential equations. I: Learning of lists (Q2528490) (← links)
- A prediction theory for some nonlinear functional-differential equations. II: Learning of patterns (Q2528491) (← links)
- On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network (Q2531768) (← links)
- On Okada's method for realizing cut-set matrices (Q2532129) (← links)
- Convexity in directed graphs (Q2532579) (← links)
- Heuristically guided search and chromosome matching (Q2542412) (← links)
- Zum Auswahlproblem (Q2544337) (← links)
- An upper bound for the rectilinear crossing number of the complete graph (Q2545098) (← links)
- Triangulated graphs and the elimination process (Q2545884) (← links)
