Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Collusivity of attack relations characterizes balance in signed frames and allows the balance theorem to hold without requiring symmetry.
citing papers explorer
-
The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.
-
Collusion Relations and their Applications to Balance Theory
Collusivity of attack relations characterizes balance in signed frames and allows the balance theorem to hold without requiring symmetry.