The following pages link to Wei Wang (Q247912):
Displaying 50 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- (Q345093) (redirect page) (← links)
- A simple arithmetic criterion for graphs being determined by their generalized spectra (Q345094) (← links)
- Generalized spectral characterization of graphs revisited (Q396911) (← links)
- (Q411245) (redirect page) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- (Q503774) (redirect page) (← links)
- A remark on the generalized spectral characterization of the disjoint union of graphs (Q503776) (← links)
- A note on non-\(\mathbb{R}\)-cospectral graphs (Q521370) (← links)
- (Q589658) (redirect page) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Vertex-deleted subgraphs and regular factors from regular graph (Q641166) (← links)
- On the generalized spectral characterizations of Eulerian graphs (Q668057) (← links)
- On the construction of graphs determined by their generalized characteristic polynomials (Q745212) (← links)
- Constructing cospectral bipartite graphs (Q785818) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra (Q852627) (← links)
- The \(T\)-shape tree is determined by its Laplacian spectrum (Q854855) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- A counterexample to a conjecture of Friedland (Q1014466) (← links)
- On a conjecture of He concerning the spectral reconstruction of matrices (Q1043842) (← links)
- On the asymptotic behavior of graphs determined by their generalized spectra (Q1045144) (← links)
- A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations (Q1354280) (← links)
- On interdependent failure resilient multi-path routing in smart grid communication network (Q1708598) (← links)
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) (Q1713301) (← links)
- New families of graphs determined by their generalized spectrum (Q1727785) (← links)
- Spectral characterization of the complete graph removing a path of small length (Q1730244) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- On bi-regular graphs determined by their generalized characteristic polynomials (Q1940102) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks (Q1958638) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- On multi-path routing for reliable communications in failure interdependent complex networks (Q2025105) (← links)
- Oriented graphs determined by their generalized skew spectrum (Q2029879) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Generalized spectral characterizations of almost controllable graphs (Q2033889) (← links)
- Constructing cospectral graphs via regular rational orthogonal matrices with level two (Q2092382) (← links)
- Smith normal form and the generalized spectral characterization of graphs (Q2092406) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- An improved condition for a graph to be determined by its generalized spectrum (Q2107506) (← links)
- Spectral characterizations of tournaments (Q2142659) (← links)
- A new criterion for almost controllable graphs being determined by their generalized spectra (Q2166304) (← links)
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs (Q2197138) (← links)
- On the complexity of all \(( g , f )\)-factors problem (Q2214040) (← links)
