The following pages link to (Q3992558):
Displaying 29 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Parallel graph component labelling with GPUs and CUDA (Q608854) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- On isomorphic subgraphs (Q685560) (← links)
- Assignment of tools to machines in a flexible manufacturing system (Q1130034) (← links)
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs (Q1183410) (← links)
- Weighted graphs and university course timetabling (Q1185992) (← links)
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
- Rabin numbers of Butterfly networks (Q1297411) (← links)
- Forbidden triples and traceability: A characterization (Q1301658) (← links)
- Characterizing forbidden pairs for hamiltonian properties (Q1367026) (← links)
- Bargaining in a network of buyers and sellers. (Q1427496) (← links)
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
- Traceability in graphs with forbidden triples of subgraphs (Q1584364) (← links)
- An algorithm for winning coalitions in indirect control of corporations (Q1601361) (← links)
- A dynamic network population model with strategic link formation governed by individual preferences (Q1790741) (← links)
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- A manifold independent approach to understanding transport in stochastic dynamical systems (Q1848742) (← links)
- Algorithmic graph theory and perfect graphs (Q1886097) (← links)
- A mathematical basis for egress complexity (Q1921174) (← links)
- Finding a complete matching with the maximum product on weighted bipartite graphs (Q2365954) (← links)
- Packing tripods: narrowing the density gap (Q2370436) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- Bargaining and network structure: an experiment (Q2455652) (← links)
- Majority vote of even and odd experts in a polychotomous choice situation (Q2563810) (← links)
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration (Q5475372) (← links)
- Global stability of complex balanced mechanisms (Q5928774) (← links)
- A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)
