23 results
Search Results
2. On the computational complexity of the bipartizing matching problem
3. Restricted power domination and zero forcing problems
4. Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs
5. On Complete Versions of Thevenin–Norton and Maximum Power Transfer Theorems
6. Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups
7. Stochastic Block Models are a Discrete Surface Tension
8. Connected power domination in graphs
9. Minimum rank and zero forcing number for butterfly networks
10. Partially user-irrepressible sequence sets and conflict-avoiding codes
11. Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
12. Optimal conflict-avoiding codes of odd length and weight three
13. Decentralized Task Reallocation on Parallel Computing Architectures Targeting an Avionics Application
14. Sparse Boolean equations and circuit lattices
15. Codes with girth 8 Tanner graph representation
16. Go With the Flow, on Jupiter and Snow. Coherence from Model-Free Video Data Without Trajectories
17. Natural Graph Wavelet Packet Dictionaries
18. Efficient robust secret sharing from expander graphs
19. Note on power propagation time and lower bounds for the power domination number
20. Graph-theoretic design and analysis of key predistribution schemes
21. On a quadratic programming problem involving distances in trees
22. On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges
23. On the minimum distance graph of an extended Preparata code
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.