The following pages link to Qian-Ping Gu (Q287063):
Displaying 50 items.
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Formal description and analysis of a distributed location service for mobile ad hoc networks (Q555783) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- (Q919831) (redirect page) (← links)
- A sharper analysis of a prallel algorithm for the all pairs shortest path problem (Q919832) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions (Q1274604) (← links)
- Node-to-node cluster fault tolerant routing in star graphs (Q1350230) (← links)
- Routing a permutation in the hypercube by two sets of edge disjoint paths (Q1373868) (← links)
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes (Q1579747) (← links)
- Algorithmic analysis for ridesharing of personal vehicles (Q1630989) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- (Q1864208) (redirect page) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Algorithmic Analysis for Ridesharing of Personal Vehicles (Q2958336) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size (Q3060763) (← links)
- Computational Study for Planar Connected Dominating Set Problem (Q3066449) (← links)
- Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem (Q3104631) (← links)
- Amplification of Bounded Depth Monotone Read-Once Boolean Formulae (Q3204041) (← links)
- Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs (Q3459900) (← links)
- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set (Q3557006) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- Learning Monotone Boolean Functions by Uniformly Distributed Examples (Q4016915) (← links)
- (Q4263917) (← links)
- (Q4321476) (← links)
- (Q4321477) (← links)
- Convergence properties of optimization algorithms for the SAT problem (Q4420897) (← links)
- (Q4525695) (← links)
- (Q4525721) (← links)
- (Q4937206) (← links)
- Cluster fault-tolerant routing in star graphs (Q4944745) (← links)
- Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time (Q4962735) (← links)
- Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths (Q5191148) (← links)
- High Performance Computing - HiPC 2003 (Q5193155) (← links)
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs (Q5233518) (← links)
- Computational Study on Dominating Set Problem of Planar Graphs (Q5505646) (← links)
- Automata, Languages and Programming (Q5716790) (← links)
- Efficient algorithms for ridesharing of personal vehicles (Q5915861) (← links)
