3204 search results - page 181 / 641 » The Alcuin Number of a Graph |
158
click to vote
MST
2010
15 years 23 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
151
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
146
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
177
click to vote
IEEECIT
2010
IEEE
15 years 4 months ago
2010
IEEE
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
192
click to vote
SIAMDM
2010
15 years 22 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...