Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...