Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 144, doi. 10.1007/s00224-023-10153-9
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2024 AND VI 68 AND IP 1
Results: 6
1
2
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 122, doi. 10.1007/s00224-023-10152-w
- By:
- Publication type:
- Article
3
Disentangling the Computational Complexity of Network Untangling.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 103, doi. 10.1007/s00224-023-10150-y
- By:
- Publication type:
- Article
4
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 75, doi. 10.1007/s00224-023-10149-5
- By:
- Publication type:
- Article
5
Quantum Algorithm for Lexicographically Minimal String Rotation.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 29, doi. 10.1007/s00224-023-10146-8
- By:
- Publication type:
- Article
6
Weighted Tree Automata with Constraints.
- Published in:
- Theory of Computing Systems, 2024, v. 68, n. 1, p. 1, doi. 10.1007/s00224-023-10144-w
- By:
- Publication type:
- Article