Pages that link to "Item:Q5710816"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710816):

Displaying 18 items.

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