Search results for: BIPARTITE GRAPH COLORING - Bridge of Knowledge

Search

Search results for: BIPARTITE GRAPH COLORING

Filters

total: 513
filtered: 405

clear all filters


Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: BIPARTITE GRAPH COLORING

  • Total Completion Time Minimization for Scheduling with Incompatibility Cliques

    Publication

    - Year 2021

    This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...

    Full text to download in external service

  • SMART SHOP SERVICES FOR BUILDING CUSTOMER-ORIENTED SCENARIOS

    Publication

    The shops of today mostly support the customer by offering him or her products based on basic relationships between products viewed or ordered by users with similar tastes. This common approach may fail in many cases especially when the user does not have sufficient knowledge about the market, or when he or she wants to build a set of products in more than one shop. New categories of smart shop services are proposed in order to...

    Full text available to download

  • Brief Announcement: Energy Constrained Depth First Search

    Publication

    - Year 2018

    Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...

    Full text to download in external service

  • A Framework for Searching in Graphs in the Presence of Errors

    Publication

    - Year 2019

    We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

    Full text to download in external service

  • Agent-based social network as a simulation of a market behaviour

    Publication

    - Year 2010

    Recent years and the outbreak of world's economic crisis in 2008 proved the crucial importance of reliable analysis of market dynamics. However, werarely apply models of proper detail level (the global prosperity forecast of 2007 can be seen as a grim proof). The behaviour of individuals and companies is far from being ideal and rational. Many claims that the economic paradigm of rational expectations (coming from J. Muth and R....