The following pages link to W. Liang (Q170442):
Displaying 32 items.
- Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841) (← links)
- Safety, domain independence and translation of complex value database queries (Q1031675) (← links)
- Finding the k most vital edges in the minimum spanning tree problem (Q1127438) (← links)
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623) (← links)
- Efficient enumeration of all minimal separators in a graph (Q1390866) (← links)
- The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\) (Q1402081) (← links)
- Parallel algorithms for the edge-coloring and edge-coloring update problems (Q1911806) (← links)
- Finding top-\(k\) influential users in social networks under the structural diversity model (Q2279536) (← links)
- Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches (Q2378529) (← links)
- Identifying structural hole spanners to maximally block information propagation (Q2656743) (← links)
- Materialized view selection under the maintenance time constraint (Q2734637) (← links)
- Data Collection Maximization in Renewable Sensor Networks via Time-Slot Scheduling (Q2982188) (← links)
- Approximation Algorithms for Min-Max Cycle Cover Problems (Q2982336) (← links)
- Affinity-Aware VNF Placement in Mobile Edge Clouds via Leveraging GPUs (Q3390184) (← links)
- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities (Q3511369) (← links)
- A parallel algorithm for finding \(K\) minimum spanning trees (Q3982549) (← links)
- (Q4025253) (← links)
- (Q4250737) (← links)
- Optimally routing LC permutations on k-extra-stage cube-type networks (Q4420914) (← links)
- Range queries in dynamic OLAP data cubes (Q4496874) (← links)
- (Q4536968) (← links)
- Making multiple views self-maintainable in a data warehouse (Q4541415) (← links)
- On the minimum number of wavelengths in multicast trees in WDM networks (Q4651939) (← links)
- (Q4778735) (← links)
- (Q4894387) (← links)
- (Q4949878) (← links)
- (Q4953343) (← links)
- Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink (Q5274521) (← links)
- Permutation routing in all-optical product networks (Q5349511) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
- Efficient algorithms for finding diversified top-\(k\) structural hole spanners in social networks (Q6191151) (← links)
