The following pages link to Yue-Li Wang (Q255279):
Displaying 50 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- A memory-efficient and fast Huffman decoding algorithm (Q294633) (← links)
- The connected \(p\)-median problem on block graphs (Q315481) (← links)
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs (Q385956) (← links)
- Two spanning disjoint paths with required length in generalized hypercubes (Q393111) (← links)
- Efficient twin domination in generalized de Bruijn digraphs (Q482195) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- Hamiltonian cycles in hypercubes with faulty edges (Q497955) (← links)
- A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
- Unique intersectability of diamond-free graphs (Q534340) (← links)
- 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- The hub number of Sierpiński-like graphs (Q649112) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- Circuits of each length in tournaments (Q742644) (← links)
- A note on optimal multiway split trees (Q802863) (← links)
- Corrigendum to: ``Incidence coloring of Cartesian product graphs'' (Q894436) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Erratum to ``A new upper bound on the queuenumber of hypercubes'' [Discrete Math. 310, No. 4, 935-939 (2010; Zbl 1231.05190)] (Q973136) (← links)
- A note on ``An improved upper bound on the queue number of the hypercube'' (Q975418) (← links)
- (Q989566) (redirect page) (← links)
- Errata for ``Faster index for property matching'' (Q989567) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes (Q1002284) (← links)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- Global defensive alliances in star graphs (Q1026159) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788) (← links)
- On the bondage number of a graph (Q1126221) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (Q1398783) (← links)
- The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs (Q1577108) (← links)
- On the powers of graphs with bounded asteroidal number (Q1587600) (← links)
- A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
- The incidence coloring numbers of meshes (Q1779599) (← links)
- A new way of counting \(n^ m\) (Q1903757) (← links)
- The minimum bandwidth required at each time slot of the fast broadcasting scheme (Q1944190) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
