Mining Significant Temporal Networks Is Polynomial

DOI10.4230/lipics.time.2020.11OpenAlexW3091207672MaRDI QIDQ6060099

Guido Sciavicco, Matteo Zavatteri, Tiziano Villa

Publication date: 2 November 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.TIME.2020.11

zbMATH Keywords

uncertaintyCSTNUDmining temporal constraintssignificant temporal network

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Dynamic controllability via timed game automata
• Temporal constraint networks
• CTP: A new constraint-based formalism for conditional, temporal planning
• Conditional simple temporal networks with uncertainty and decisions
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Conditional Simple Temporal Networks with Uncertainty and Resources

This page was built for publication: Mining Significant Temporal Networks Is Polynomial