3105 search results - page 167 / 621 » The Path-Packing Structure of Graphs |
150
click to vote
DAM
2008
15 years 3 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
124
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We describe algorithms to build self-assembling robot systems composed of active modular robots and passive bars. The distributed algorithms are based on locally optimal matchi...
131
Voted
VL
2003
IEEE
15 years 8 months ago
2003
IEEE
We built a prototype tool for browsing constraint systems for the layout of graphical objects. It has two views: In one view, the tool visualizes a constraint system as a threedim...
143
Voted
PRICAI
1998
Springer
15 years 7 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
124
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...