9532 search results - page 411 / 1907 » Logic, Graphs, and Algorithms |
185
click to vote
CMSB
2006
Springer
15 years 10 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
169
click to vote
SSPR
2000
Springer
15 years 10 months ago
2000
Springer
An algorithm for learning structural patterns given in terms of Attributed Relational Graphs (ARG's) is presented. The algorithm, based on inductive learning methodologies, pr...
175
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
161
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
138
click to vote
JCT
2008
15 years 6 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...