1162 search results - page 34 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
134
click to vote
TMC
2008
15 years 3 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
147
click to vote
DAM
2007
15 years 3 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
170
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
144
click to vote
DAM
2010
15 years 3 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
178
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...