منابع مشابه
Constrained Graph Processes
Let Q be a monotone decreasing property of graphs G on n vertices. Erdős, Suen and Winkler [5] introduced the following natural way of choosing a random maximal graph in Q: start with G the empty graph on n vertices. Add edges to G one at a time, each time choosing uniformly from all e ∈ G such that G + e ∈ Q. Stop when there are no such edges, so the graph G∞ reached is maximal in Q. Erdős, Su...
متن کاملLanguage Constrained Graph Problems
This paper starts by discussing an algorithmic view of labeled path problems. In particular, we apply Seidel’s all-pairs shortest-path algorithm for undirected and unweighted graphs to a basic problem in labeled paths. Seidel’s algorithm is applied to find unlabeled paths between any pairs of nodes in a labeled graph whose associated context-free grammar G can generate the empty string . Our re...
متن کاملDensity-Constrained Graph Clustering
Clusterings of graphs are often constructed and evaluated with the aid of a quality measure. Numerous such measures exist, some of which adapt an established measure for graph cuts to clusterings. In this work we pursue the problem of finding clusterings which simultaneously feature guaranteed intraand good intercluster quality. To this end we systematically assemble a range of cut-based bicrit...
متن کاملConstrained Graph Drawing
II Teile dieser Arbeit basieren auf Veröffentlichungen, die aus der Zusammenar-beit mit anderen Wissenschaftlerinnen und Wissenschaftlern entstanden sind. Zu allen diesen Inhalten wurden wesentliche Beiträge geleistet. Baumträger haben und ein Algorithmus, um einen solchen effizient zu berechnen, falls er existiert.
متن کاملConstrained Markov Decision Processes
2 i To Tania and Einat ii Preface In many situations in the optimization of dynamic systems, a single utility for the optimizer might not suuce to describe the real objectives involved in the sequential decision making. A natural approach for handling such cases is that of optimization of one objective with constraints on other ones. This allows in particular to understand the tradeoo between t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1496