Path-Based Supports for Hypergraphs (Q3000490)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Path-Based Supports for Hypergraphs	scientific article

Statements

scholarly article

0 references

Path-Based Supports for Hypergraphs (English)

0 references

0 references

Sabine Cornelsen

0 references

0 references

Arnaud Sallaberry

0 references

Lecture Notes in Computer Science

0 references

publication date

19 May 2011

0 references

full work available at URL

http://nbn-resolving.de/urn:nbn:de:bsz:352-179948

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the Desirability of Acyclic Database Schemes

0 references

Blocks of Hypergraphs

0 references

On Planar Supports for Hypergraphs

0 references

Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees

0 references

Hypergraph planarity and the complexity of drawing venn diagrams

0 references

Subdivision Drawings of Hypergraphs

0 references

The clustering matroid and the optimal clustering tree

0 references

Mixed hypercacti

0 references

An Improved Algorithm for the Metro-line Crossing Minimization Problem

0 references

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-19222-7_3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3000490

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3000490&oldid=35227710"