A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. The problem considered is that of finding a minimum feedback vertex set given a weighted and undirected graph. We present a…
Papers in Discrete Mathematics
Discrete Mathematics papers in Mathematics, A
Papers
1  20 of
261
in Discrete Mathematics, A


A method is developed to take the eddy currents in lamination stacks into account with the finiteelement method using the threedimensional (3D) magnetic vector potential mag netodynamic formulation. It consists in converting the stacked…

Until now, the analysis of fault tolerance of peertopeer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worstcase manner are hardly…

We propose a way of measuring the similarity of a Boolean vector to a given set of Boolean vectors, motivated in part by certain data mining or machine learning problems. We relate the similarity measure to one based on Hamming distance and we…

Boosting is a general method for improving the accuracy of any given learning algorithm. This short overview paper introduces the boosting algorithm AdaBoost, and explains the underlying theory of boosting, including an explanation of why boosting…

The Tor network is one of the largest deployed anonymity networks, consisting of 1500+ volunteerrun relays and probably hundreds of thousands of clients connecting every day. Its large userbase has made it attractive for researchers to analyze…

In this paper the following is proved: Let K ⊂ E2 be a smooth strictly convex body, and let L ⊂ E2 be a line. Assume that for every point x ∈ L\K the two tangent segments from x to K have the same length, and the line joining the two contact points…

The uniqueness of a binary doublyeven selfdual [48, 24, 12] code is used to prove that a selforthogonal 5(48, 12, 8) design, as well as some of its derived and residual designs, including a quasisymmetric 2(45, 9, 8) design, are all unique up…

One of the classical results in graph theory is the matrixtree theorem which asserts that the determinant of a cofactor of the combinatorial Laplacian is equal to the number of spanning trees in a graph (see [1, 17, 11, 15]). The usual notion of…

The panel data unit root test suggested by Levin and Lin (LL) has been widely used in several applications, notably in papers on tests of the purchasing power parity hypothesis. This test is based on a very restrictive hypothesis which is rarely…

Most discussions of computer security focus on control of disclosure. In Particular, the U.S. Department of Defense has developed a set of criteria for computer mechanisms to provide control of classified information. However, for that core of data…

Logistic regression is a workhorse of statistics and is closely related to methods used in Machine Learning, including the Perceptron and the Support Vector Machine. This note compares eight different algorithms for computing the maximum…

There are many (mixed) integer programming formulations of the Steiner problem in networks. The corresponding linear programming relaxations are of great interest particularly, but not exclusively, for computing lower bounds; but not much has been…

The initial genomescale reconstruction of the metabolic network of Escherichia coli K12 MG1655 was assembled in 2000. It has been updated and periodically released since then based on new and curated genomic and biochemical knowledge. An update…

Background: Amplitudeintegrated electroencephalography (aEEG) allows continuous brain function monitoring at bedside. Objectives: This prospective cohort study was designed to longitudinally evaluate aEEG tracings at increased postmenstrual age…

We have applied an algorithmic methodology which provably decomposes any complex network into a complete family of principal subcircuits to study the minimal circuits that describe the Krebs cycle. Every operational behavior that the network is…

BACKGROUND: Many preventable diseases such as ischemic heart diseases and breast cancer prevail at a large scale in the general population. Computerized decision support systems are one of the solutions for improving the quality of prevention…

The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for obtaining mathematical theorems goes back to Leibniz and has been revived by Peano around the turn of the century and by…

In 19971998, the Netherlands experienced a large epidemic of classical swine fever (CSF). The magnitude of this epidemic stressed the role information systems could play in supporting the management during an eradication campaign. The enforcement…

In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
Papers in associated subdisciplines
Sign up today  FREE
Mendeley saves you time finding and organizing research. Learn more
 All your research in one place
 Add and import papers easily
 Access it anywhere, anytime