ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (7)
  • Matching  (4)
  • Branching  (3)
  • pattern recognition  (3)
  • Springer  (7)
  • Annual Reviews
  • Elsevier
  • Institute of Physics
  • Oxford University Press
  • Springer Nature
  • Thomas Telford
  • Wiley
  • 2005-2009
  • 1990-1994
  • 1980-1984  (7)
  • 1982  (7)
  • Computer Science  (7)
  • Architecture, Civil Engineering, Surveying
Collection
  • Articles  (7)
Source
Keywords
Publisher
  • Springer  (7)
  • Annual Reviews
  • Elsevier
  • Institute of Physics
  • Oxford University Press
    • +
Years
  • 2005-2009
  • 1990-1994
  • 1980-1984  (7)
Year
Topic
  • Computer Science  (7)
  • Architecture, Civil Engineering, Surveying
  • Mathematics  (4)
  • 1
    Electronic Resource
    Electronic Resource
    Optimum matching forests II: General weights (1982)
    Springer
    Mathematical programming 22 (1982), S. 12-38 
    Details
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Linear Programming ; Polyhedron
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Matching forests generalize branchings in a directed graph and matchings in an undirected graph. We present an efficient algorithm, the PMF Algorithm, for the problem: given a mixed graphG and a real weight on each of its edges, find a perfect matching forest of maximum weight-sum. The PMF Algorithm proves the sufficiency of a linear system which definesP = (G) andP(G), the convex hull of incidence vectors of perfect matching forests and matching forests respectively ofG. The algorithm also provides a generalization of Tutte's theorem on the existence of perfect matchings in an undirected graph.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581023
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Optimum matching forests I: Special weights (1982)
    Springer
    Mathematical programming 22 (1982), S. 1-11 
    Details
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We introduce the concept of matching forests as a generalization of branchings in a directed graph and matchings in an undirected graph. Given special weights on the edges of a mixed graph, we present an efficient algorithm for finding an optimum weight-sum matching forest. The algorithm is a careful application of known branching and matching algorithms. The maximum cardinality matching forest problem is solved as a special case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581022
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Rank of maximum matchings in a graph (1982)
    Springer
    Mathematical programming 22 (1982), S. 52-70 
    Details
    ISSN: 1436-4646
    Keywords: Duality ; Graph ; Matching ; Polytope
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The matching polytope is the convex hull of the incidence vectors of all (not necessarily perfect) matchings of a graphG. We consider here the problem of computing the dimension of the face of this polytope which contains the maximum cardinality matchings ofG and give a good characterization of this quantity, in terms of the cyclomatic number of the graph and families of odd subsets of the nodes which are always nearly perfectly matched by every maximum matching. This is equivalent to finding a maximum number of linearly independent representative vectors of maximum matchings ofG; the size of such a set is called thematching rank ofG. We also give in the last section a way of computing that rank independently of those parameters. Note that this gives us a good lower bound on the number of those matchings.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581025
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Optimum matching forests III: Facets of matching forest polyhedra (1982)
    Springer
    Mathematical programming 22 (1982), S. 39-51 
    Details
    ISSN: 1436-4646
    Keywords: Graph ; Matching ; Branching ; Polyhedron ; Facet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In [3] we presented a linear system which definesP(G), the convex hull of incidence vectors of matching forests of a mixed graphG. However, many of the inequalities of this system may be redundant. Here we describe the dimension of the facets ofP(G) obtained by setting one inequality of the defining system forP(G) to an equation. This leads to a presentation of a minimal defining linear system forP(G), i.e., to a presentation of the facets ofP(G). This generalizes earlier characterizations of facets of 1-matching polyhedra and of branching polyhedra.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581024
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Rough sets (1982)
    Springer
    International journal of parallel programming 11 (1982), S. 341-356 
    Details
    ISSN: 1573-7640
    Keywords: Artificial intelligence ; automatic classification ; cluster analysis ; fuzzy sets ; inductive reasoning ; learning algorithms ; measurement theory ; pattern recognition ; tolerance theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate in this paper approximate operations on sets, approximate equality of sets, and approximate inclusion of sets. The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory. Some applications are outlined.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01001956
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    An efficient algorithm for finding kleene closure of regular expression matrices (1982)
    Springer
    International journal of parallel programming 11 (1982), S. 409-415 
    Details
    ISSN: 1573-7640
    Keywords: Kleene closure ; regular expression matrices ; fuzzy regular expression matrices ; automata theory ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An efficient algorithm for finding the Kleene closure of regular expressions matrices or fuzzy regular expression matrices is presented and illustrated by examples. Properties of Kleene closure are also investigated. The results may have useful applications in automata theory, pattern recognition, and pictorial information systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00996818
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Syntactic/semantic techniques in pattern recognition: A survey (1982)
    Springer
    International journal of parallel programming 11 (1982), S. 75-100 
    Details
    ISSN: 1573-7640
    Keywords: Attributes ; attributed grammars ; automata ; features ; formal languages ; grammatical inferrence ; linguistic ; pattern recognition ; probabilistic systems ; semantics ; stochastic systems ; structure ; syntax ; syntactic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper surveys some of the contemporary work in syntactic/semantic pattern recognition, with emphasis on four topics that are active research areas. These areas-grammatical inferrence, probabilistic models, syntactic errorcorrection, and grammars with attributes-present challenging questions both as to theory and as to practice.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00995525
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...