Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. A note of reliability analysis of \(SM\)-\(\lambda\) in folded-crossed hypercube with conditional faults: Label: en
  2. Non-adaptive and adaptive two-sided search with fast objects: Label: en
  3. The generalized \(3\)-connectivity of exchanged crossed cube: Label: en
  4. Smooth subsum search a heuristic for practical integer factorization: Label: en
  5. A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes: Label: en
  6. Rainbow domination in Cartesian product of paths and cycles: Label: en
  7. Total 2-rainbow domination in graphs: complexity and algorithms: Label: en
  8. Quantum and approximation algorithms for maximum witnesses of Boolean matrix products: Label: en
  9. Algorithmic aspects of total vertex-edge domination in graphs: Label: en
  10. Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks: Label: en
  11. Connectivity status of intuitionistic fuzzy graphs and its applications: Label: en
  12. Two new classes of (almost) perfect \(c\)-nonlinear permutations: Label: en
  13. On the span of \(\ell\) distance coloring of infinite hexagonal grid: Label: en
  14. Vertex and link residual closeness of graphs of given fractional matching number: Label: en
  15. An improved approximation algorithm for the capacitated correlation clustering problem: Label: en
  16. On the shared transportation problem: computational hardness and exact approach: Label: en
  17. Routing among convex polygonal obstacles in the plane: Label: en
  18. Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs: Label: en
  19. Hardness results of connected power domination for bipartite graphs and chordal graphs: Label: en
  20. Parameterized complexity classes defined by threshold circuits and their connection with sorting networks: Label: en
  21. Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions: Label: en
  22. Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover: Label: en
  23. Preface -- special issue: Research in combinatorial optimization and applications of COCOA 2021: Label: en
  24. Approximating all-points furthest pairs and maximum spanning trees in metric spaces: Label: en
  25. On the super (edge)-connectivity of generalized Johnson graphs: Label: en
  26. Parameterized algorithms for fixed-order book drawing with few crossings per edge: Label: en
  27. A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks: Label: en
  28. Robust subgroup multisignature with one-time public keys in order: Label: en
  29. On two modifications of the McEliece PKE and the CFS signature scheme: Label: en
  30. The structure fault tolerance of alternating group networks: Label: en
  31. A simple and efficient method for accelerating construction of the gap-greedy spanner: Label: en
  32. The wide diameter and fault diameter of exchanged crossed cube: Label: en
  33. Embedding augmented cube into certain trees and windmill graphs: Label: en
  34. Approximation algorithms for partial vertex covers in trees: Label: en
  35. Node and link vulnerability in complete multipartite networks: Label: en
  36. The longest path problem in odd-sized \(O\)-shaped grid graphs: Label: en
  37. Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength: Label: en
  38. The \(g\)-good-neighbor conditional diagnosabilities of hypermesh optical interconnection networks under the PMC and comparison models: Label: en
  39. Linear codes and linear complementary pairs of codes over a non-chain ring: Label: en
  40. Influential node identification of network based on agglomeration operation: Label: en
  41. Balanced even-variable rotation symmetric Boolean functions with optimal algebraic immunity, maximum algebraic degree and higher nonlinearity: Label: en
  42. Tree-Based Generation of Restricted Graph Languages: Label: en
  43. Synthesizing Computable Functions from Rational Specifications Over Infinite Words: Label: en
  44. Reachability Analysis of Self Modifying Code: Label: en
  45. Transportation Problem Allowing Sending and Bringing Back: Label: en
  46. Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern: Label: en
  47. Online and Approximate Network Construction from Bounded Connectivity Constraints: Label: en
  48. Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube: Label: en
  49. Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions: Label: en
  50. Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:EntityUsage/Q2703009"
Powered by MediaWiki