Graph-Theoretic Concepts in Computer Science

DOI10.1007/b104584zbMath1112.68426OpenAlexW4211210842MaRDI QIDQ5710816

Takeaki Uno, Shin-ichi Nakano

Publication date: 8 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104584

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

Listing closed sets of strongly accessible set systems with applications to data mining ⋮ An efficient algorithm for solving pseudo clique enumeration problem ⋮ Family Trees for Enumeration ⋮ Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs ⋮ A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization ⋮ Unnamed Item ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ An Efficient Algorithm for Enumerating Pseudo Cliques ⋮ A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization ⋮ Counting the number of independent sets in chordal graphs ⋮ Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs ⋮ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties ⋮ Efficient enumeration of all ladder lotteries and its application ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ Random Generation and Enumeration of Proper Interval Graphs ⋮ Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs ⋮ Skyline groups are ideals. An efficient algorithm for enumerating skyline groups

This page was built for publication: Graph-Theoretic Concepts in Computer Science