Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• On the independent dominating set polytope (Q2368719) (← links)
• Efficient transitive closure of sparse matrices over closed semirings (Q2368941) (← links)
• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
• Post-processing interstitialcy diffusion from molecular dynamics simulations (Q2374930) (← links)
• Path planning versus cue responding: a bio-inspired model of switching between navigation strategies (Q2376517) (← links)
• A web-based decision support system for waste lube oils collection and recycling (Q2378411) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• New length bounds for cycle bases (Q2380021) (← links)
• Uniquely-determined thinning of the tie-zone watershed based on label frequency (Q2384112) (← links)
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
• A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
• Shortest paths in stochastic networks with correlated link costs (Q2387385) (← links)
• Anytime search in dynamic graphs (Q2389673) (← links)
• A low complexity algorithm for non-monotonically evolving fronts (Q2399235) (← links)
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
• Computing source-to-target shortest paths for complex networks in RDBMS (Q2402355) (← links)
• Solving all-pairs shortest path by single-source computations: theory and practice (Q2403799) (← links)
• A cooperative game-theoretic approach to the social ridesharing problem (Q2407882) (← links)
• Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path (Q2422936) (← links)
• Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
• Influence maximization with deactivation in social networks (Q2424770) (← links)
• Algebraic theory on shortest paths for all flows (Q2424883) (← links)
• Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
• Long and short paths in uniform random recursive dags (Q2431087) (← links)
• Dynamic programming and minimum risk paths (Q2432847) (← links)
• Distance spectral radius of trees with fixed number of pendent vertices (Q2435380) (← links)
• The covering Canadian traveller problem (Q2440168) (← links)
• Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
• Web page importance ranking (Q2442799) (← links)
• Minimum cost spanning tree problems with indifferent agents (Q2442831) (← links)
• Performance of algebraic graphs based stream-ciphers using large finite fields (Q2442943) (← links)
• The graph matching problem (Q2444585) (← links)
• Weighted distances between preferences (Q2444691) (← links)
• Efficiency improvement in an \(n\)D systems approach to polynomial optimization (Q2457407) (← links)
• Breadth-first heuristic search (Q2457631) (← links)
• A path-based double projection method for solving the asymmetric traffic network equilibrium problem (Q2458917) (← links)
• Finding the shortest path in stochastic networks (Q2459617) (← links)
• Local solutions for global problems in wireless networks (Q2466005) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection (Q2469234) (← links)
• A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
• Quasi-isometric parameterization for texture mapping (Q2476582) (← links)
• New algorithms for multi objective shortest path problem. (Q2477107) (← links)
• Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
• Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
• GNet: a generalized network model and its applications in qualitative spatial reasoning (Q2482430) (← links)
• An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
• The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)