4074 search results - page 374 / 815 » Abstract Graph Transformation |
150
Voted
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
158
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract –Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determin...
159
click to vote
COCOON
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
170
click to vote
ICTCS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
150
Voted
EPIA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present an approach to agents that can reason, react to the environment and are able to update their own knowledge as a result of new incoming information. Each agents...