Results 1  10
of
5,937
Parallel Algorithms for Hypergraph Partitioning
, 2006
"... Nearoptimal decomposition is central to the efficient solution of numerous problems in scientific computing and computeraided design. In particular, intelligent a priori partitioning of input data can greatly improve the runtime and scalability of largescale parallel computations. Discrete data ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Nearoptimal decomposition is central to the efficient solution of numerous problems in scientific computing and computeraided design. In particular, intelligent a priori partitioning of input data can greatly improve the runtime and scalability of largescale parallel computations. Discrete
Intersections of hypergraphs
, 2012
"... Given two weighted kuniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given two weighted kuniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions. 1
Orientability thresholds for random hypergraphs
"... Let h> w> 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To worient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)orientation of H consists of a worientation of ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Let h> w> 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To worient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)orientation of H consists of a worientation
SUPERIMPOSED CODES AND HYPERGRAPHS CONTAINING NO GRIDS
"... The study of nonlinear wave dynamics with long waves, or in shallow water, has a long history dating back to the 1800s. The study of water waves leads to a number of interesting nonlinear equations including certain integrable equations which possess solitons as special solutions. A novel formulatio ..."
Abstract
 Add to MetaCart
The study of nonlinear wave dynamics with long waves, or in shallow water, has a long history dating back to the 1800s. The study of water waves leads to a number of interesting nonlinear equations including certain integrable equations which possess solitons as special solutions. A novel
Pattern Hypergraphs
, 2010
"... The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph H is a hypergraph where each edge is assigned a type Πi that determines which of possible colorings of the edge are proper. A vertex coloring of H is proper if it is proper ..."
Abstract
 Add to MetaCart
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph H is a hypergraph where each edge is assigned a type Πi that determines which of possible colorings of the edge are proper. A vertex coloring of H is proper if it is proper
Perspective Hypergraphs and Cellular Networks
, 2009
"... The understanding of biological networks is a fundamental issue in computational biology. When analyzing topological properties of networks, one often tends to substitute the term ‘‘network’ ’ for ‘‘graph’’, or uses both terms interchangeably. From a mathematical perspective, this is often not fully ..."
Abstract
 Add to MetaCart
The understanding of biological networks is a fundamental issue in computational biology. When analyzing topological properties of networks, one often tends to substitute the term ‘‘network’ ’ for ‘‘graph’’, or uses both terms interchangeably. From a mathematical perspective, this is often not fully correct, because many functional relationships in biological networks are more complicated than what can be represented in graphs. In general, graphs are combinatorial models for representing relationships (edges) between certain objects (nodes). In biology, the nodes typically describe proteins,
Hypergraphic Oriented Matroid Relational Dependency Flow Models of Chemical Reaction Networks
, 2009
"... In this paper we derive and present an application of hypergraphic oriented matroids for the purpose of enumerating the variable interdependencies that define the chemical complexes associated with the kinetics of nonlinear dynamical system representations of chemical kinetic reaction flow networks ..."
Abstract
 Add to MetaCart
In this paper we derive and present an application of hypergraphic oriented matroids for the purpose of enumerating the variable interdependencies that define the chemical complexes associated with the kinetics of nonlinear dynamical system representations of chemical kinetic reaction flow
Results 1  10
of
5,937