Sciweavers

3396 search results - page 42 / 680
» Tree representations of graphs
Sort
View
83
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
BMCBI
2007
134views more  BMCBI 2007»
15 years 20 days ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
112
Voted
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 6 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
86
Voted
TROB
2008
112views more  TROB 2008»
15 years 13 days ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
TSMC
1998
109views more  TSMC 1998»
15 years 5 days ago
Using graph parsing for automatic graph drawing
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
Carolyn McCreary, Richard Chapman, Fwu-Shan Shieh