Sciweavers

3105 search results - page 237 / 621
» The Path-Packing Structure of Graphs
Sort
View
WG
2007
Springer
15 years 10 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
FLAIRS
2007
15 years 6 months ago
Deriving Chronological Information from Texts through a Graph-Based Algorithm
We propose a method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline....
Cosmin Adrian Bejan
WSC
1997
15 years 5 months ago
A Java Based System for Specifying Hierarchical Control Flow Graph Models
The portion of the Hierarchical Modeling And Simulation System-Java (HiMASS-j) used for specifying Hierarchical Control Flow Graph (HCFG) Models is described. The specification o...
Thorsten Daum, Robert G. Sargent
119
Voted
CGA
2006
15 years 4 months ago
From Linear Story Generation to Branching Story Graphs
Interactive narrative systems are storytelling systems in which the user can influence the content or ordering of story world events. Conceptually, an interactive narrative can be...
Mark O. Riedl, R. Michael Young
JPDC
2006
134views more  JPDC 2006»
15 years 3 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong