Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Hypergraph regularity method (view), Hypergraph removal lemma (view), Hypergraphia (view), Hypergraphic (view), Hypergraphy (view), Matching in hypergraphs (view), Line graph of a hypergraph (view), Vertex cover in hypergraphs (view), Hall-type theorems for hypergraphs (view), Bipartite hypergraph (view), Width of a hypergraph (view), D-interval hypergraph (view), Packing in a hypergraph (view), Symmetric hypergraph theorem (view), Balanced hypergraph (view), Perfect matching in high-degree hypergraphs (view), Hedgehog (hypergraph) (view), Discrepancy of hypergraphs (view)

searching for Hypergraph 53 found (198 total)

alternate case: hypergraph

Altair Engineering (2,347 words) [view diff] no match in snippet view article find links to article

Altair Engineering Inc. is an American multinational information technology company headquartered in Troy, Michigan. It provides software and cloud solutions

Ümit Çatalyürek (867 words) [view diff] exact match in snippet view article find links to article

Aykanat. His dissertation was published by the Bilkent University as Hypergraph Models for Sparse Matrix Partitioning and Reordering. Çatalyürek began

Gábor N. Sárközy (241 words) [view diff] exact match in snippet view article find links to article

the nature of embeddings of large sparse graphs into dense graphs. A hypergraph variant was developed later by Peter Keevash. He is member of the editorial

27 (number) (724 words) [view diff] exact match in snippet view article

26 and preceding 28. Including the null-motif, there are 27 distinct hypergraph motifs. There are exactly twenty-seven straight lines on a smooth cubic

Object co-segmentation (926 words) [view diff] exact match in snippet view article find links to article

segmentation applications. As an extension of regular graph cuts, multi-level hypergraph cut is proposed to account for more complex high order correspondences

Maker-Breaker game (3,434 words) [view diff] exact match in snippet view article find links to article

specific hypergraphs are known on which the strategy stops working. In all conditions, k is the size of winning-sets (i.e., the game hypergraph is k-uniform)

List of PPAD-complete problems (167 words) [view diff] exact match in snippet view article find links to article

networks Fractional stable paths problems Fractional hypergraph matching (see also the NP-complete Hypergraph matching) Fractional strong kernel Scarf's lemma

Graph state (1,976 words) [view diff] exact match in snippet view article find links to article

state is a particular case of a stabilizer state as well as a 2-uniform hypergraph state, a generalization where the edges have cardinality between 1 and

Turán's theorem (3,502 words) [view diff] exact match in snippet view article find links to article

3 {\displaystyle 3} -uniform hypergraph can have without containing the complete 3 {\displaystyle 3} -uniform hypergraph on 4 {\displaystyle 4} vertices

Placement (electronic design automation) (1,994 words) [view diff] exact match in snippet view article

When IC designs grew to millions of components, placement leveraged hypergraph partitioning using nested-partitioning frameworks such as Capo. Combinatorial

Decomposition method (constraint satisfaction) (5,804 words) [view diff] exact match in snippet view article

definition of cutset for hypergraphs: a cycle hypercutset of a hypergraph is a set of edges (rather than vertices) that makes the hypergraph acyclic when all

Numerical 3-dimensional matching (689 words) [view diff] exact match in snippet view article find links to article

problem. Given an instance of numeric 3d-matching , construct a tripartite hypergraph with sides X {\displaystyle X} , Y {\displaystyle Y} and Z {\displaystyle

Clique-width (2,057 words) [view diff] exact match in snippet view article find links to article

Bruno; Engelfriet, Joost; Rozenberg, Grzegorz (1993), "Handle-rewriting hypergraph grammars", Journal of Computer and System Sciences, 46 (2): 218–270, doi:10

Sparse matrix–vector multiplication (111 words) [view diff] exact match in snippet view article find links to article

multiplication General-purpose computing on graphics processing units#Kernels "Hypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in

Van H. Vu (617 words) [view diff] exact match in snippet view article find links to article

the sharp threshold for the existence of a perfect matching in a random hypergraph. In 2010, Terence Tao and Vu solved the circular law conjecture in random

Chemical graph generator (5,049 words) [view diff] exact match in snippet view article find links to article

generating a hypergraph. Then, the size of the graph is reduced with respect to the constraints. First, the existence of substructures in the hypergraph is checked

Expander mixing lemma (2,171 words) [view diff] exact match in snippet view article find links to article

generalization of the mixing lemma to hypergraphs. Let H {\displaystyle H} be a k {\displaystyle k} -uniform hypergraph, i.e. a hypergraph in which every "edge" is

Peter Keevash (388 words) [view diff] exact match in snippet view article find links to article

published many results in combinatorics, particularly in extremal graph and hypergraph theory and Ramsey Theory. In joint work with Tom Bohman he established

Antoon Kolen (478 words) [view diff] exact match in snippet view article find links to article

selection: Brouwer, Andries E., and Antoon WJ Kolen. "A super-balanced hypergraph has a nest point." Stichting Mathematisch Centrum. Zuivere Wiskunde ZW

Moritz Pasch (443 words) [view diff] exact match in snippet view article find links to article

ISBN 9789048194162. Pasch's theorem Pasch's axiom Pasch configuration Pasch hypergraph Ordered geometry Dirk Schlimm, "The correspondence between Moritz Pasch

Uniformization (probability theory) (608 words) [view diff] exact match in snippet view article

N.; Harrison, P. G.; Knottenbelt, W. J. (2004). "Uniformization and hypergraph partitioning for the distributed computation of response time densities

OpenCog (1,252 words) [view diff] exact match in snippet view article find links to article

in as a part of a generic graph query engine, for performing graph and hypergraph pattern matching (isomorphic subgraph discovery). This generalizes the

W. G. Brown (405 words) [view diff] exact match in snippet view article find links to article

277. Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias (2006), "Extremal hypergraph problems and the regularity method", in Klazar, Martin; Kratochvíl, Jan;

William Lawrence Kocay (224 words) [view diff] exact match in snippet view article find links to article

Combinatorial mathematics, IX (Brisbane, 1981), LNM Some NP-complete problems for hypergraph degree sequences, CJ Colbourn, WL Kocay, DR Stinson – Discrete Applied

Georg Gottlob (1,048 words) [view diff] exact match in snippet view article find links to article

Eiter, T.; Gottlob, G. (1995). "Identifying the Minimal Transversals of a Hypergraph and Related Problems". SIAM Journal on Computing. 24 (6): 1278. CiteSeerX 10

Viewport (552 words) [view diff] case mismatch in snippet view article find links to article

(link) http://www.tecgraf.puc-rio.br/ftp_pub/lfm/L1J_WindowViewport.pdf https://www.siggraph.org/education/materials/HyperGraph/viewing/view2d/2dview0.htm

Nerve complex (1,643 words) [view diff] exact match in snippet view article find links to article

theorem at the nLab Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912

CiteULike (1,055 words) [view diff] exact match in snippet view article find links to article

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido (25 September 2009). "Hypergraph topological quantities for tagged social networks". Physical Review E

NP-intermediate (1,534 words) [view diff] exact match in snippet view article find links to article

Addison-Wesley. p. 236. ISBN 9780201530827. Eiter, Thomas; Gottlob, Georg (2002). "Hypergraph transversal computation and related problems in logic and AI". In Flesca

NP-intermediate (1,534 words) [view diff] exact match in snippet view article find links to article

Addison-Wesley. p. 236. ISBN 9780201530827. Eiter, Thomas; Gottlob, Georg (2002). "Hypergraph transversal computation and related problems in logic and AI". In Flesca

Graph theory (6,237 words) [view diff] exact match in snippet view article find links to article

problem, also called hitting set, can be described as a vertex cover in a hypergraph. Decomposition, defined as partitioning the edge set of a graph (with

Kleene Award (126 words) [view diff] exact match in snippet view article find links to article

Tzevelekos "Full abstraction for nominal general references" 2008 David Duris "Hypergraph Acyclicity and Extension Preservation Theorems" 2009 Oliver Friedmann

Independence complex (1,059 words) [view diff] exact match in snippet view article find links to article

mathematics. Aharoni, Ron; Haxell, Penny (2000). "Hall's theorem for hypergraphs". Journal of Graph Theory. 35 (2): 83–88. doi:10

Jean-Daniel Fekete (1,295 words) [view diff] exact match in snippet view article find links to article

Jean-Daniel (1 January 2021). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization". IEEE Transactions on Visualization

Factor-critical graph (1,801 words) [view diff] exact match in snippet view article find links to article

of 1-matching polyhedra", in Berge, C.; Ray-Chaudhuri, D. K. (eds.), Hypergraph Seminar, Lecture Notes in Mathematics, vol. 411, Springer-Verlag, pp. 214–242

Leroy P. Steele Prize (2,239 words) [view diff] exact match in snippet view article find links to article

in hypergraphs," published in the Journal of the American Mathematical Society. David Saxton and Andrew Thomason for their 2015 paper "Hypergraph Containers

Radiosity (computer graphics) (2,668 words) [view diff] case mismatch in snippet view article

original on 2006-10-12. Retrieved 2006-12-29. Radiosity Overview, from HyperGraph of SIGGRAPH (provides full matrix radiosity algorithm and progressive

Biased positional game (1,069 words) [view diff] exact match in snippet view article find links to article

Beck gives a winning condition for Maker. It uses the pair-degree of the hypergraph - denoted by d 2 {\displaystyle d_{2}} . This condition can be generalized

Set cover problem (2,683 words) [view diff] exact match in snippet view article find links to article

Subhash; Regev, Oded (2003), A new multilayered PCP and the hardness of hypergraph vertex cover, Association for Computing Machinery, pp. 595–601, doi:10

Waiter–Client game (678 words) [view diff] exact match in snippet view article find links to article

{\mathcal {F}})} . Suppose the winning-sets are all of size k (i.e., the game-hypergraph is k-uniform). In a Maker-Breaker game, the Erdos-Selfridge theorem implies

N-sphere (7,330 words) [view diff] exact match in snippet view article find links to article

S2CID 119297359. Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912

Amnon Shashua (1,690 words) [view diff] exact match in snippet view article find links to article

Processing Systems. 15. Zass, R; Shashua, A (2008). "Probabilistic graph and hypergraph matching". 2008 IEEE Conference on Computer Vision and Pattern Recognition

Shmuel Onn (1,423 words) [view diff] exact match in snippet view article find links to article

over slim three-dimensional tables, the settling of the complexity of hypergraph degree sequences, and the introduction of colorful linear programming

Sankt Andreasberg Observatory (1,091 words) [view diff] exact match in snippet view article find links to article

reflecting telescope, featuring a primary mirror of 400 mm diameter (16″ f/8 Hypergraph) and a computer aided mount of type Knopf MK70S were first used during

Hunter Snevily (1,693 words) [view diff] exact match in snippet view article find links to article

1007/s00493-003-0031-2. S2CID 20035419. Chvátal, V. (1974). Unsolved Problem No. 7. Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972)

Envy-free pricing (2,559 words) [view diff] exact match in snippet view article find links to article

Laekhanukit and Nanongkai prove approximation hardness to a variant called k-hypergraph pricing. They also prove hardness for unit-demand min-buying and single-minded

One-way quantum computer (6,454 words) [view diff] exact match in snippet view article find links to article

S2CID 14422769. M. Rossi; M. Huber; D. Bruß; C. Macchiavello (2013). "Quantum Hypergraph States". New Journal of Physics. 15 (11): 113022. arXiv:1211.5554. Bibcode:2013NJPh

Vadym Slyusar (1,986 words) [view diff] exact match in snippet view article find links to article

sketch operations, in a popular Natural Language Processing models, and hypergraph models of similarity. The Face-splitting product and his properties used

Igor L. Markov (2,996 words) [view diff] exact match in snippet view article find links to article

for Circuit partitioning: high-performance heuristic optimizations for hypergraph partitioning Placement: algorithms for finding ( x , y ) {\displaystyle

Blow-up lemma (2,789 words) [view diff] exact match in snippet view article find links to article

deterministic. Peter Keevash found a generalization of the blow-up lemma to hypergraphs in 2010. Stefan Glock and Felix Joos discovered a variant of the blow-up

Khatri–Rao product (4,395 words) [view diff] exact match in snippet view article find links to article

sketch operations, A popular Natural Language Processing models, and hypergraph models of similarity, Generalized linear array model in statistics Two-

Work motivation (7,141 words) [view diff] exact match in snippet view article find links to article

Paul M. (2012). Psychology Applied to Work. Summerfield, North Carolina: Hypergraph Press, Inc. Schaufeli, W. B., & Bakker, A. B. (2010), Defining and measuring

Gene Disease Database (4,135 words) [view diff] exact match in snippet view article find links to article

Suzanne Renick; Dombrower, Micah; Goldberg, Debra S. (2014). "Using 2-node hypergraph clustering coefficients to analyze disease-gene networks". Proceedings