Algebraic properties of edge ideals via combinatorial topology.
Algebraic properties of Husimi trees
Algebraic Structure Count of Some Cyclic Hexagonal-square Chains
Algebraic tools for the construction of colored flows with boundary constraints
We give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The main tool is the notion of height function, previously introduced for tilings. It appears as an extension of the notion of potential of a flow in a planar...
Algebraic tools for the construction of colored flows with boundary constraints
We give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The main tool is the notion of height function, previously introduced for tilings. It appears as an extension of the notion of potential of a flow in...
Algebraically solvable problems: describing polynomials as equivalent to explicit solutions.
Algèbre des descentes et cogroupes dans les algèbres sur une opérade
Algèbre linéaire et cheminement dans un graphe
Algorithm 36. Transitive closure of a graph
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 69. Two distances between hypergraphs
Algorithm 88. A new algorithm calculating the distance between binary arborescences
Algorithm and experiments in testing planar graphs for isomorphism.
Algorithm engineering for optimal graph bipartization.
Algorithm for the complement of orthogonal operations
G. B. Belyavskaya and G. L. Mullen showed the existence of a complement for a -tuple of orthogonal -ary operations, where , to an -tuple of orthogonal -ary operations. But they proposed no method for complementing. In this article, we give an algorithm for complementing a -tuple of orthogonal -ary operations to an -tuple of orthogonal -ary operations and an algorithm for complementing a -tuple of orthogonal -ary operations to an -tuple of orthogonal -ary operations. Also we find some...
Algorithmes de plus courts chemins pour traiter des données floues
Algorithmic aspects of bipartite graphs.
Algorithmic aspects of total-subdomination in graphs
Let G = (V,E) be a graph and let k ∈ Z⁺. A total k-subdominating function is a function f: V → {-1,1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total k-subdomination number of G is the minimum value of f(V) over all total k-subdominating functions f of G where f(V) denotes the sum of the function values assigned to the vertices under f. In this paper, we present a cubic time algorithm to compute the total k-subdomination...
Algorithmische Kombinatorik mit Kleinrechnern.
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations