4865 search results - page 191 / 973 » The Complexity of Graph Connectivity |
128
Voted
CAINE
2003
15 years 5 months ago
2003
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
161
Voted
CSCW
2004
ACM
15 years 3 months ago
2004
ACM
Awareness of others' interests can lead to fruitful collaborations, friendships and positive social change. Interviews of groups involved in both research and corporate work r...
148
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
124
click to vote
COMBINATORICA
2007
15 years 3 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
129
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...